#include <bits/stdc++.h>
#define rep(x, l, r) for(int x = l; x <= r; x++)
#define mp make_pair
using namespace std;
typedef long long ll;

const double l = log10((1 + sqrt(5)) / 2);
const int MAXN = 2e5 + 5;
const int MAXM = 1e7 + 5;
const int mod1 = 998244353;
const int mod2 = 19260817;
const int mod3 = 20050213;
struct node{
	int h1, h2, h3;
	double num;
} a[MAXN];
int mx, h1[MAXM], h2[MAXM], h3[MAXM]; 
char st[2000005];
double Lg[10];
//ll ss[105];

bool cmp(node a, node b){
	return a.num < b.num;
}
map<pair<int,pair<int,int>>, int> M; 

void ins(int i){
	if(M.find(mp(a[i].h1, mp(a[i].h2, a[i].h3))) == M.end())
		M[mp(a[i].h1, mp(a[i].h2, a[i].h3))] = 0;
	M[mp(a[i].h1, mp(a[i].h2, a[i].h3))]++;
}
int check(int x1, int x2, int x3){
	if(M.find(mp(x1, mp(x2, x3))) == M.end()) return 0;
	return M[mp(x1, mp(x2, x3))];
}
	
int main(){
	int n;
	scanf("%d", &n);
	mx = 0;
	rep(i, 1, 9) Lg[i] = log10(i);
	rep(i, 1, n){
		scanf("%s", st);
		int len = strlen(st);
		a[i].num = (Lg[st[0] - '0'] + len ) / l;
		rep(j, 0, len - 1){
			int x = st[j] - '0';
			a[i].h1 = (10ll * a[i].h1 + x) % mod1;
			a[i].h2 = (a[i].h2 * 10 + x) % mod2;
			a[i].h3 = (a[i].h3 * 10 + x) % mod3;
		}
		mx = max(mx, (int)a[i].num + 1);
	}
	sort(a + 1, a + n + 1, cmp);
	h1[0] = h2[0] = h3[0] = h1[1] = h2[1] = h3[1] = 1;
	rep(i, 2, mx + 10){
		h1[i] = (h1[i - 1] + h1[i - 2]) % mod1;
		h2[i] = (h2[i - 1] + h2[i - 2]) % mod2;
		h3[i] = (h3[i - 1] + h3[i - 2]) % mod3;
	}
	ll ans = 0;
	rep(i, 1, n){
		int id = (int)a[i].num + 1;
		rep(j, -5, 5){
			int y1 = (h1[id + j] - a[i].h1 + mod1) % mod1;
			int y2 = (h2[id + j] - a[i].h2 + mod2) % mod2;
			int y3 = (h3[id + j] - a[i].h3 + mod3) % mod3;
//			printf("%d %d\n", h1[id + j], a[i].h1);
//			printf("%d %d :: %d %d %d\n", i, j, y1, y2, y3);
			ans += check(y1, y2, y3);
		}
		ins(i);
	}
	printf("%lld\n", ans);
	return 0;
}