#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define elif else if
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int,int>


#define repname(a, b, c, d, e, ...) e
#define rep(...)                    repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define rep0(x)                     for (int rep_counter = 0; rep_counter < (x); ++rep_counter)
#define rep1(i, x)                  for (int i = 0; i < (x); ++i)
#define rep2(i, l, r)               for (int i = (l); i < (r); ++i)
#define rep3(i, l, r, c)            for (int i = (l); i < (r); i += (c))





struct ScalarInput {
    template<class T>
    operator T(){
        T ret;
        cin >> ret;
        return ret;
    }
};
struct VectorInput {
    size_t n;
    VectorInput(size_t n): n(n) {}
    template<class T>
    operator vector<T>(){
        vector<T> ret(n);
        for(T &x : ret) cin >> x;
        return ret;
    }
};
ScalarInput input(){ return ScalarInput(); }
VectorInput input(size_t n){ return VectorInput(n); }

template<typename T>
void print(vector<T> a){
  for(int i=0;i<a.size();i++){
    cout<<a[i]<<" \n"[i+1==a.size()];
  }
}

template<class T>
void print(T x){
    cout << x << '\n';
}
 
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail){
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

long double logphi=0.2089876402499787337692720892375554168224592399182109535392875613;

constexpr ll mod=177414070102078489LL;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int N;
  int m=2'000'100;
  vector<vector<int>>sizes(m);
  vector<ll>fib;
  
  {
    long double now=-logphi;
    int idx=0;
    while(now<m-10){
      sizes[max(0,(int)floor(now))].push_back(idx);
      idx++;
      now+=logphi;
    }
    fib.resize(idx);
    fib[0]=1;
    fib[1]=2;
    for(int i=2;i<idx;i++){
      fib[i]=fib[i-1]+fib[i-2];
      fib[i]%=mod;
    }
  }

  vector<pair<int,string>>vals;
  cin>>N;
  rep(i,N){
    string s;
    cin>>s;
    vals.push_back({s.size(),s});
  }
  sort(vals.begin(),vals.end());

  ll ans=0;
  map<ll,ll>cnt;
  for(auto [len,s]:vals){
    ll hash=0;
    for(auto x:s){
      hash=(hash*10)+(x-'0');
      hash%=mod;
    }
    for(int i=max(0,len-2);i<=len+2;i++){
      for(auto j:sizes[i]){
        ll res=(fib[j]-hash+mod)%mod;
        ans+=cnt[res];
      }
    }
    cnt[hash]++;
  }
  print(ans);
}