#include<bits/stdc++.h>
#define ll long long
#define pii pair<ll,ll>
#define lowbit(x) (x&-x)
//#define log(x) (31^__builtin_clz(x))
using namespace std;
#define ld long double
int b[10000005];
ll fib[10000005];
const ll p=1000000000001117ll,sd=10;
bool cmp(string &a,string &b){
    if(a.size()!=b.size())return a.size()<b.size();
    return a<b;
}
void solve(){
    ld sq5=sqrtl(5),lg=log((1+sq5)/2)/log(10),lg5=log(sq5)/log(10);
    fib[1]=1;
    for(int i=1;i<=1e7;i++){
        b[i]=floor(lg*i+lg5);
        if(b[i]<=0)b[i]=1;
    }
    for(int i=2;i<=1e7;i++){
        fib[i]=fib[i-1]+fib[i-2];
        if(fib[i]>=p)fib[i]-=p;
    }
    int n;
    cin>>n;
    vector<string>s(n);
    fib[1]=1;
    for(int i=1;i<=n;i++){
        cin>>s[i-1];
    }
    sort(s.begin(),s.end(),cmp);
    map<ll,int>mp;
    ll ans=0;
    for(int i=0;i<n;i++){
        ll tmp=0;
        for(auto u:s[i]){
            tmp=(tmp*10+u-48)%p;
        }
        int loc=lower_bound(b+1,b+(int)1e7+1,s[i].size())-b;
        for(int i=max(loc-1,1);i<=loc+9&&i<=1e7;i++){
            ans+=mp[(fib[i]-tmp+p)%p];
        }
        mp[tmp]++;
    }
    cout<<ans<<"\n";
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--)solve();
    return 0;
}