#include<bits/stdc++.h>
#define ll long long
#define rep(i,l,r) for(int i(l),i##end(r);i<=i##end;++i)
#define per(i,r,l) for(int i(r),i##end(l);i>=i##end;--i)
using namespace std;
const int N=2e5+10,M=1e7; const ll P=1e18,mod=1e17+9;
int n; ll f[M+10],res; long double d[M+10]; int k[M+10]; 
char s[2000020];
struct node{ int n; ll x; }a[N];
unordered_map<ll,int> mp;
inline ll sub(ll x,ll y){ return x<y?x-y+mod:x-y; }
signed main(){
    // freopen("1.in","r",stdin);
    f[0]=f[1]=d[0]=d[1]=1,k[0]=k[1]=0;//1
    rep(i,2,M){
        f[i]=(f[i-1]+f[i-2])%mod;
        d[i]=(k[i-2]==k[i-1]?d[i-2]:d[i-2]/10)+d[i-1];
        k[i]=k[i-1];
        if(d[i]>=10) d[i]/=10,k[i]++;
    }
    cerr<<1.0*clock()/CLOCKS_PER_SEC<<"s\n";
    
    scanf("%d",&n);
    rep(i,1,n){
        scanf("%s",s+1);
        a[i].n=strlen(s+1);
        rep(j,1,a[i].n) a[i].x=(a[i].x*10+s[j]-'0')%mod;
        // cerr<<a[i].x<<'\n';
    }
    sort(a+1,a+n+1,[](node i,node j){ return i.n<j.n; });
    cerr<<1.0*clock()/CLOCKS_PER_SEC<<"s\n";

    int j=2;
    rep(i,1,n){
        while(1+k[j]<a[i].n) j++;
        // cerr<<a[i].n<<' '<<j<<' '<<d[j]<<' '<<k[j]<<'\n';
        ll v=a[i].x;
        rep(t,j,min(M,j+40)) res+=mp[sub(f[t],v)];
        mp[v]++;
    }
    cout<<res;

    cerr<<"\n"<<1.0*clock()/CLOCKS_PER_SEC<<"s\n";
    return 0;
}//g++ -g my.cpp -o my -std=c++14 -O2  -Wall -Wextra -Wshadow -Wconversion