#include<bits/stdc++.h>
using namespace std;
using i64=long long;
constexpr double W=4.784971965;
constexpr i64 mod[3]{998244353,998244853,1000000007};
array<i64,3>fib[20000010];
char buf[2000010];
string str[100010];
map<array<i64,3>,int>cnt;
int main(){
   fib[1]={1,1,1};
   for(int i=2;i<=20000000;i++){
      for(int t:{0,1,2})fib[i][t]=(fib[i-1][t]+fib[i-2][t])%mod[t];
   }
   int n;scanf("%d",&n);
   i64 ans=0;
   for(int i=1;i<=n;i++)scanf("%s",buf),str[i].assign(buf);
   sort(str+1,str+n+1,[](const string&x,const string&y){
      if(x.length()!=y.length())return x.length()<y.length();
      return lexicographical_compare(rbegin(x),rend(x),rbegin(y),rend(y));
   });
   for(int i=1;i<=n;i++){
      int m=str[i].length(),L=max(2,(int)(W*(m-1)-2)),R=W*(m+1)+3;
      array<i64,3>a{};
      for(char c:str[i]){
         for(int t:{0,1,2})a[t]=(a[t]*10+c-'0')%mod[t];
      }
      for(int k=L;k<=R;k++){
         array<i64,3>b{};
         for(int t:{0,1,2})b[t]=(fib[k][t]+mod[t]-a[t])%mod[t];
         ans+=cnt[b];
      }cnt[a]++;
   }
   printf("%lld",ans);
   return 0;
}