#include<bits/stdc++.h>
using namespace std;
#define ll long long
// #define mp make_pair
#define pb push_back
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
ll rd(){
    ll x=0,f=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}
#define d rd()

ll n;
const ll mod[2]={180181327,998244353};
map<pair<ll,ll>,ll>mp;
ll fib[10000010][2];
ll a[200010][2];
char c[2000010];
ll res;
const double lgphi=log10((1+sqrt(5))/2);
int main(){
    n=d;fib[1][0]=fib[1][1]=1;
    f(i,2,10000000)fib[i][0]=(fib[i-1][0]+fib[i-2][0])%mod[0],fib[i][1]=(fib[i-1][1]+fib[i-2][1])%mod[1];
    f(i,1,n){
        scanf("%s",c+1);ll len=strlen(c+1)*1.0/lgphi;
        ll x=0,y=0;ll t=strlen(c+1);
        f(j,1,t){
            x=(x*10+c[j]-'0')%mod[0];
            y=(y*10+c[j]-'0')%mod[1];
        }//cout<<i<<" "<<x<<" "<<y<<" "<<len<<endl;
        f(j,max(0ll,len-20),min(len+20,10000000ll)){
            res+=mp[{(fib[j][0]-x+mod[0])%mod[0],(fib[j][1]-y+mod[1])%mod[1]}];

            // if(mp[{(fib[j][0]-x+mod[0])%mod[0],(fib[j][1]-y+mod[1])%mod[1]}]>0)cout<<i<<" "<<j<<" "<<mp[{(fib[j][0]-x+mod[0])%mod[0],(fib[j][1]-y+mod[1])%mod[1]}]<<endl;
        }
        mp[{x,y}]++;
    }cout<<res<<endl;
    return 0;
}