#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]={1000000007,998244353};
map<pair<ll,ll>,ll>mp;
ll fib[20000010][2];
// ll a[200010][2];
char c[2000010];
struct node{ll x,y,o;}a[200010];
bool cmp(node a,node b){return a.o<b.o;}
ll res;
const double lgphi=1.0/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 x=0,y=0;ll t=strlen(c+1);
        double k=0,o=0;
        f(j,1,t){
            if(j<=20)k=k*10+c[j]-'0';else o++;
            x=(x*10+c[j]-'0')%mod[0];
            y=(y*10+c[j]-'0')%mod[1];
        }ll len=(1.0*(log10(sqrt(5))+log10(k)+o)*lgphi);
        a[i]={x,y,len};
    }
    sort(a+1,a+n+1,cmp);
    f(i,1,n){
        for(int j=max(0ll,a[i].o-20);j<=min(a[i].o+20,10000000ll);j++){
            res+=mp[{(fib[j][0]-a[i].x+mod[0])%mod[0],(fib[j][1]-a[i].y+mod[1])%mod[1]}];
        }mp[{a[i].x,a[i].y}]++;
    }
    cout<<res<<endl;
    return 0;
}