#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pl = pair<ll, ll>;

const ll MOD1 = 1e9 + 7;
const ll MOD2 = 1e9 + 9;
const double INF = 1e9;

struct nr {
    double l;
    ll r1, r2;

    nr(int v = 0) {
        r1 = v % MOD1;
        r2 = v % MOD2;
        if(!v) {
            l = -INF;
            return;
        }
        l = log10(double(v));
    }

    nr(string s) {
        r1 = r2 = 0;
        l = 0;
        double val = 0;
        double factor = 1.;
        for(auto it : s) {
            val += (it - '0') * factor;
            r1 = (r1 * 10 + it - '0') % MOD1;
            r2 = (r2 * 10 + it - '0') % MOD2;
            factor /= 10;
        }
        l = log10(val) + (double)s.size() - 1;
    }

    friend istream &operator>>(istream &i, nr &that) {
        string s;
        i >> s;
        that = nr(s);
        return i;
    }
};

pl add(pl a, pl b) {
    return pl({(a.first + b.first) % MOD1, (a.second + b.second) % MOD2});
}

pl sub(pl a, pl b) {
    return pl({(a.first - b.first + MOD1) % MOD1, (a.second - b.second + MOD2) % MOD2});
}


int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<nr> V(n);
    for(int i = 0; i < n; ++i) cin >> V[i];
    sort(V.begin(), V.end(), [&](auto a, auto b) { return a.l < b.l; });
    pl a(0, 0), b(1, 1), c;

    const int NFIBO = 4e6;

    vector<pl> RestF;

    for(int i = 0; i < NFIBO; ++i) {
        RestF.push_back(a);
        c = add(a, b);
        a = b;
        b = c;
    }

    map<pl, int> M;
    ll re = 0;
    for(int i = 0; i < n; ++i) {
        int bound = int(V[i].l * 4.784971966781666);
        pl v = pl(V[i].r1, V[i].r2);
        for(int j = bound - 1; j < bound + 5; ++j) {
            if(j < 0) continue;
            auto c = sub(RestF[j], v);
            re += M[c];
        }
        ++M[v];
    }

    cout << re << "\n";
    return 0;
}