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

#define ll long long
#define ull unsigned long long
// const ll MOD = 4179340454199820289;
const ll MOD = 998244353;
#define __int128 ll
#define MAXN 10000010
#define C 7

ll fib[MAXN];
void pre()
{
    fib[0] = 0, fib[1] = 1;
    for (int i = 2; i < MAXN; i++)
    {
        fib[i] = ((__int128)fib[i - 2] + fib[i - 1]) % MOD;
    }
}

__int128 trans(const string& s)
{
    __int128 ans = 0;
    for (int i = 0; i < s.length(); i++)
    {
        (ans *= 10) %= MOD;
        (ans += s[i] - '0') %= MOD;
    }
    return ans;
}

const double lgB = log10((1 + sqrt(5)) / 2);

void solve()
{
    int n;
    cin >> n;
    map<ll, int> sts;
    vector<string> ss(n);
    for (int i = 0; i < n; i++)
    {
        cin >> ss[i];
    }
    vector<int> order(n);
    iota(order.begin(), order.end(), 0);
    sort(order.begin(), order.end(), [&](int i, int j)->bool
         {
        if(ss[i].length() != ss[j].length())
            return ss[i].length() < ss[j].length();
        // if(ss[i].length() >= 1 && ss[i][0] != ss[j][0])
        //     return ss[i][0] < ss[j][0];
        // if(ss[i].length() >= 2 && ss[i][1] != ss[j][1])
        //     return ss[i][1] < ss[j][1];
        // return true;
        return ss[i] < ss[j];
         });
    ll ans = 0;
    for (int i : order)
    {
        const string &s = ss[i];
        ll x = trans(s);
        int p = s.length() / lgB;
        for (int j = max(0, p - C); j < min(p + C, MAXN); j++)
        {
            ll y = (fib[j] - x + MOD) % MOD;
            if(sts.contains(y))
                ans += sts[y];
        }
        sts[x]++;
    }
    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    pre();
    int t = 1;
    while (t--)
    {
        solve();
    }
}