#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
#define int LL
#define double LD
const int N = 1e7 + 5;
const int M = 2e5 + 5;
const int MOD = 1e18 + 114559;
const double lgs = log((1.L + sqrtl(5)) / 2);

int n;
int fi[N];
string s[M];
int a[N];
map<int, int> mp;
int ans;
int calc(string s)
{
    double tog = 0;
    for (int i = s.size() - 1; i >= 0; i--) {
        tog *= 0.1;
        tog += s[i] - '0';
    }
    return (log(tog) + log(10) * (s.length() - 1)) / lgs;
}
void solve()
{
    fi[1] = 1;
    for (int i = 2; i <= 10000000; i++) fi[i] = (fi[i - 1] + fi[i - 2]) % MOD;

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
    }
    sort(s + 1, s + 1 + n, [&](string x, string y) {
      return x.length() == y.length() ? x < y : x.length() < y.length();
    });
    for (int i = 1; i <= n; i++) {
        a[i] = 0;
        for (int j = 0; j < s[i].length(); j++) {
            a[i] = (a[i] * 10 + s[i][j] - '0') % MOD;
        }
        int tmp = max(calc(s[i]) - 2, 2LL);
        for (int j = tmp; j <= tmp + 9; j++) {
            int r = (fi[j] + MOD - a[i]) % MOD;

            if (mp.count(r)) {
                ans += mp[r];
            }
        }
        mp[a[i]] += 1;
    }
    cout << ans << "\n";
}

signed main()
{
    cin.tie(nullptr)->ios::sync_with_stdio(false);
    int _ = 1;
    while (_--) {
        solve();
    }
    return 0;
}