#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int mod[2] = {1000000009, 998244353};
const int N = 2e7 + 10;

void solve() {
	int n;
	cin >> n;
	vector<string> v(n);
	for(int i = 0; i < n; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end(), [&](string s, string t) {
		if(s.size() != t.size()) {
			return s.size() < t.size();
		}
		return s < t;
	});
	vector<pii> f(N);
	f[0] = {0, 0}, f[1] = {1, 1};
	for(int i = 2; i < N; i++) {
		f[i].first = (f[i - 1].first + f[i - 2].first) % mod[0];
		f[i].second = (f[i - 1].second + f[i - 2].second) % mod[1];	
	}
	map<pii, int> mp;
	int ans = 0;
	for(int i = 0; i < n; i++) {
		ll res0 = 0, res1 = 0;
		int l = v[i].size();
		for(int j = 0; j < l; j++) {
			res0 = (res0 * 10 + v[i][j] - '0') % mod[0];
			res1 = (res1 * 10 + v[i][j] - '0') % mod[1];
		}
		int index = (log10(sqrt(5)) + log10(v[i][0] - '0') + l - 1) / log10((sqrt(5) + 1) / 2);
		if(l == 1) {
			if(v[i][0] == '1') {
				index = 2;
			} else if(v[i][0] == '2') {
				index = 3;
			} else if(v[i][0] == '3') {
				index = 4;
			} else if(v[i][0] <= '5') {
				index = 5;
			} else if(v[i][0] <= '8') {
				index = 6;
			} else {
				index = 7;
			}
		}
		for(int j = 0; j <= 5; j++) {
			int nd1 = (f[index + j].first - res0 + mod[0]) % mod[0];
			int nd2 = (f[index + j].second - res1 + mod[1]) % mod[1];
			ans += mp[{nd1, nd2}];
		}
		mp[{res0, res1}]++;
	}
	cout << ans;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	solve();
	return 0;
}