#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < A[i].size(); j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};
struct aabb {
	int x1, y1, x2, y2;
	aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

struct initializer {
	initializer() {
		cout << fixed << setprecision(20);
	}
};
initializer _____;
ll gcd(ll a, ll b) {
	if (b == 0)
		return a;
	else
		return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
	int d = a;
	if (b != 0) {
		d = extgcd(b, a % b, y, x);
		y -= (a / b) * x;
	} else {
		x = 1;
		y = 0;
	}
	return d;
}
ll factorial(ll x) {
	if (x == 1)
		return 1;
	else
		return x * factorial(x - 1);
}
ll Mfactorial(ll x, ll m) {
	ll ret = 1;
	for (ll i = 1; i <= x; i++) {
		ret *= i;
		ret %= m;
	}
	return ret;
}
vector< int > MfactTable(int n, int m) {
	vector< int > ret(n + 1);
	ret[0] = 1;
	int tmp = 1;
	for (int i = 1; i <= n; i++) {
		tmp *= i;
		tmp %= m;
		ret[i] = tmp;
	}
	return ret;
}
int Minverse(int a, int m) {
	int x, y;
	extgcd(a, m, x, y);
	return (m + x % m) % m;
}
int McombSmall(int n, int k, int m) {
	//O(n)
	if (k > n)
		return 0;
	int ret = Mfactorial(n, m);
	ret *= Minverse(Mfactorial(k, m), m);
	ret %= m;
	ret *= Minverse(Mfactorial(n - k, m), m);
	return ret % m;
}
int McombFromFactTable(vector< int > &T, int n, int k, int m) {
	if (k > n)
		return 0;
	int ret = T[n];
	ret *= Minverse(T[k], m);
	ret %= m;
	ret *= Minverse(T[n - k], m);
	return ret % m;
}
ll pow(ll x, int n) {
	if (n == 0)
		return 1;
	ll ret = (n & 1) ? x : 1;
	ll a = pow(x, n / 2);
	return ret * a * a;
}
ll Mpow(ll x, int n, int m) {
	if (n == 0)
		return 1;
	ll ret = (n & 1) ? x : 1;
	ll a = Mpow(x, n / 2, m);
	return (((ret * a) % m) * a) % m;
}
vector< vector< int > > combTable(int N) {
	vector< vector< int > > ret(N + 1, vector< int >(N + 1));
	for (int i = 0; i <= N; i++)
		for (int j = 0; j <= i; j++) {
			if (j == 0 || j == i)
				ret[i][j] = 1;
			else
				ret[i][j] = ret[i - 1][j - 1] + ret[i - 1][j];
		}
	return ret;
}
int countNmodPisQlr(int l, int r, int P, int Q) {
	//r>=l>=0
	return (r - Q + P) / P - (l - Q + P - 1) / P;
}
struct Combination {
	int N = 0, M;
	vector< int > Ftable, FItable, Inversetable;
	void init() {
		Ftable.resize(N + 1);
		FItable.resize(N + 1);
		Inversetable.resize(N + 1);
		Ftable[0] = 1;
		FItable[0] = 1;
		for (int i = 1; i <= N; i++)
			Ftable[i] = Ftable[i - 1] * i % M;
		FItable[N] = Minverse(Ftable[N], M);
		for (int i = N - 1; i >= 1; i--)
			FItable[i] = FItable[i + 1] * (i + 1) % M;
		Inversetable[1] = 1;
		for (int i = 2; i <= N; i++)
			Inversetable[i] = M - Inversetable[M % i] * (M / i) % M;
	}
	Combination(int max, int mod) {
		N = max;
		M = mod;
		init();
	}
	int calc(int n, int k) {
		if (k > n)
			return 0;
		int ret = Ftable[n] * FItable[k] % M * FItable[n - k] % M;
		return ret;
	}
	int inverse(int n) { return Inversetable[n]; }
	int factorial(int n) { return Ftable[n]; }
	int factorialInverse(int n) { return FItable[n]; }
	int permutation(int n, int k) {
		if (k > n)
			return 0;
		return Ftable[n] * FItable[n - k] % M;
	}
};
struct SegT2d {
	int H, W;
	vector< vector< int > > dat;
	SegT2d() {}
	SegT2d(vector< vector< int > > &f) {
		H = W = 1;
		while (H < (int)f.size())
			H <<= 1;
		while (W < (int)f[0].size())
			W <<= 1;
		dat.assign(2 * H - 1, vector< int >(2 * W - 1, INF));
		init(f);
	}
	void init(vector< vector< int > > &f) {
		for (int i = 0; i < (int)f.size(); i++)
			for (int j = 0; j < (int)f[0].size(); j++)
				dat[i + H - 1][j + W - 1] = f[i][j];
		for (int i = 2 * H - 2; i > H - 2; i--)
			for (int j = W - 2; j >= 0; j--)
				dat[i][j] = (dat[i][2 * j + 1] + dat[i][2 * j + 2]);
		for (int i = H - 2; i >= 0; i--)
			for (int j = 0; j < 2 * W - 1; j++)
				dat[i][j] = (dat[2 * i + 1][j] + dat[2 * i + 2][j]);
	}
	int get(int li, int lj, int ri, int rj) { return get_h(li, lj, ri, rj, 0, H, 0); }
	int get_h(int li, int lj, int ri, int rj, int si, int ti, int k) {
		if (ri <= si or ti <= li)
			return 0;
		if (li <= si and ti <= ri)
			return get_w(lj, rj, 0, W, k, 0);
		const int mi = (si + ti) / 2;
		return (get_h(li, lj, ri, rj, si, mi, 2 * k + 1) + get_h(li, lj, ri, rj, mi, ti, 2 * k + 2));
	}
	int get_w(int lj, int rj, int sj, int tj, int i, int k) {
		if (rj <= sj or tj <= lj)
			return 0;
		if (lj <= sj and tj <= rj)
			return dat[i][k];
		const int mj = (sj + tj) / 2;
		return (get_w(lj, rj, sj, mj, i, 2 * k + 1) + get_w(lj, rj, mj, tj, i, 2 * k + 2));
	}
};

//9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
/* BIT2D:
    初期値は全て 0
    ・add(h,w,x): (h,w) に x を加算する
    ・sum(h,w): 1≦i≦h かつ 1≦j≦w の範囲の合計値を求める
    ・query(h1,w1,h2,w2): h1≦i<h2 かつ w1≦j<w2 の範囲の合計値を求める(1-indexed)
    計算量は全て O(logW * logH)
*/
template < typename T >
struct BIT2D {
	int H, W;
	vector< vector< T > > bit; // データの格納先
	BIT2D(int H_, int W_) { init(H_, W_); }
	void init(int H_, int W_) {
		H = H_ + 1;
		W = W_ + 1;
		bit.assign(H, vector< T >(W, 0));
	}

	void add(int h, int w, T x) {
		for (int i = h; i < H; i += (i & -i)) {
			for (int j = w; j < W; j += (j & -j)) {
				bit[i][j] += x;
			}
		}
	}
	// 1≦i≦h かつ 1≦j≦w
	T sum(int h, int w) {
		T s(0);
		for (int i = h; i > 0; i -= (i & -i)) {
			for (int j = w; j > 0; j -= (j & -j)) {
				s += bit[i][j];
			}
		}
		return s;
	}

	// h1≦i<h2 かつ w1≦j<w2
	T query(int h1, int w1, int h2, int w2) {
		return sum(h2 - 1, w2 - 1) - sum(h2 - 1, w1 - 1) - sum(h1 - 1, w2 - 1) + sum(h1 - 1, w1 - 1);
	}
};
int N, M, K, T, Q, H, W;
signed main() {
	cin >> N;
	vector< string > A(N);
	rep(i, N) cin >> A[i];
	vector< pii > B(N);
	rep(i, N) {
		int c = 0, d = 0;
		int f = 0, n = 0;
		rep(j, A[i].size()) {
			if (A[i][j] == '.') {
				f = 1;
			} else {

				c *= 10;
				c += (A[i][j] - '0');
				if (f) {

					n++;
					d++;
				}
			}
		}
		while (n < 9) {
			d++;
			c *= 10;
			n++;
		}
		B[i].first = c;
		B[i].second = d;
	}
	//cout << B[0].first << " " << B[0].second;
	vector< vector< int > > tmp(100, vector< int >(100, 0));
	SegT2d sgt(tmp);
	BIT2D< int > bt(100, 100);
	int ans = 0;
	rep(i, N) {
		int b = B[i].first;
		int two = 0, five = 0;
		while (b % 2 == 0) {
			two++;
			b /= 2;
		}
		while (b % 5 == 0) {
			five++;
			b /= 5;
		}
		//cerr << two << " " << five << endl;
		ans += bt.query(18 - two + 1, 18 - five + 1, 100, 100);
		bt.add(two + 1, five + 1, 1);
	}
	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 13244