#include <bits/stdc++.h>
using namespace std;
const double del = (1.0 + sqrt(5)) / 2.0;
const double w = log10(del);
bool cmp(string a, string b) {
    return a.length() < b.length();
}
const int mod1 = 1e9 + 7, mod2 = 1e9 + 9;
pair<int, int> add(pair<int, int> x, pair<int, int> y) {
    pair<int, int> res = {0, 0};
    res.first = (x.first + y.first) % mod1;
    res.second = (x.second + y.second) % mod2;
    return res;
}
pair<int, int> sub(pair<int, int> x, pair<int, int> y) {
    pair<int, int> res = {0, 0};
    res.first = (x.first - y.first + mod1) % mod1;
    res.second = (x.second - y.second + mod2) % mod2;
    return res;
}
pair<int, int> F[8000005];
string s[200005];
void solve() {
    int n;
    cin >> n;
    F[0] = F[1] = {1, 1};
    for (int i = 2; i <= 8000000; ++i) F[i] = add(F[i - 1], F[i - 2]);
    for (int i = 1; i <= n; ++i) cin >> s[i];
    sort(s + 1, s + n + 1, cmp);
    unordered_map<long long, int> app;
    long long ans = 0;
    for (int i = 1; i <= n; ++i) {
        int ls = 0, rs = 0;
        int len = s[i].length();
        for (int j = 0; j < len; ++j) ls = (10ll * ls % mod1 + s[i][j] - '0') % mod1, rs = (10ll * rs % mod2 + s[i][j] - '0') % mod2;
        int di = len / w;
        pair<int, int> now = {ls, rs};
        for (int j = max(di - 5, 0); j <= min(di + 15, 8000000); ++j) {
            pair<int, int> nxt = sub(F[j], now);
            long long flag = 1ll * nxt.first * mod2 + nxt.second;
            if (app.count(flag)) ans += app[flag];
        }
        long long now1 = 1ll * ls * mod2 + rs;
        if (app.count(now1))
            app[now1]++;
        else
            app[now1] = 1;
    }
    cout << ans << endl;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
}