#include <bits/stdc++.h>

/* snippet: useful macros and functions */
#define ARC(i, a, b) for(Int i = (a); i < (b); ++i)
#define RC(i, n) ARC(i, 0, n)
#define ARCH(i, a, b) for(Int i = (a) - 1; i >= (b); --i)
#define RCH(i, n) ARCH(i, n, 0)
#define ALL(v) v.begin(), v.end()
template<class T> T rng(const T &a, const T &b){ return a < b ? b - a : a - b; }
template<class T> void chmaxmin(T &a, const T &b, const T &(*f)(const T &, const T &)){ a = f(a, b); }
#define chmax(a, b) chmaxmin(a, b, std::max)
#define chmin(a, b) chmaxmin(a, b, std::min)

#if __has_include(<experimental/iterator>)
#include <experimental/iterator>
auto debug = std::experimental::make_ostream_joiner(std::cout, " ");
#endif

/* snippet: inf struct */
#if __cplusplus >= 201703
struct{ template<class T> constexpr operator T(){ return std::numeric_limits<T>::max(); } constexpr auto operator-(); } inf;
struct{ template<class T> constexpr operator T(){ return std::numeric_limits<T>::lowest(); } constexpr auto operator-(); } negative_inf;
constexpr auto decltype(inf)::operator-(){ return negative_inf; }
constexpr auto decltype(negative_inf)::operator-(){ return inf; }
#endif

/* snippet: modint library */
#if __cpp_concepts
template<std::signed_integral T, T MOD>
#else
template<class T, T MOD>
#endif
class Modint{
	T val;
public:
	Modint(T val = 0) : val(val % MOD + (val >= 0 ? 0 : MOD)) {}
	operator T(){ return val; }
	Modint &operator+=(const Modint &a){ val += a.val; if(val >= MOD) val -= MOD; return *this; }
	Modint &operator-=(const Modint &a){ val -= a.val; if(val < 0) val += MOD; return *this; }
	Modint &operator*=(const Modint &a){ val = val * a.val % MOD; return *this; }
	void inverse(){T x[2]={MOD,val},a[2]={0,1};int i;for(i=0;x[!i];i^=1){a[i]-=x[i]/x[!i]*a[!i];x[i]=x[i]%x[!i];}if(!i)a[i]+= MOD;val=a[i];}
	Modint &operator/=(Modint a){ a.inverse(); return *this *= a; }
	friend Modint modpow(Modint a, int n){ Modint ret(1); while(n){ if(n & 1) ret *= a; a *= a; n >>= 1; } return ret; }
	friend Modint operator+(Modint a, const Modint &b){ return a += b; }
	friend Modint operator-(Modint a, const Modint &b){ return a -= b; }
	friend Modint operator*(Modint a, const Modint &b){ return a *= b; }
	friend Modint operator/(Modint a, const Modint &b){ return a /= b; }
	friend std::ostream &operator<<(std::ostream &os, const Modint &a){ return os << a.val; }
};

/* push n numbers and get i-th min */
/* to get min and 2nd min, declare K_th_min<T, 2> and use get<0>(), get<1>() */
#if __cplusplus >= 201703
template<class T, std::size_t K>
class K_th_min{
	friend class K_th_min<T, K + 1>;
	T val;
	K_th_min<T, K - 1> lower;
	void push_(T &x){ lower.push_(x); if(val > x) std::swap(val, x); }
public:
	K_th_min() : val(std::numeric_limits<T>::max()) {}
	void push(T x){ push_(x); }
	template<std::size_t I> T get(){ if constexpr(I == K - 1) return val; else return lower.template get<I>(); }
};
template<class T> class K_th_min<T, 0>{ friend class K_th_min<T, 1>; void push_(T &){} public: K_th_min(){} void push(T){} };
#endif

/* snippet: using declarations */
using Int = long long;
using std::cout;
using std::cin;
using std::endl;
using Mint = Modint<long long, 1000000007>;

struct rational{
	Int x, y;
	rational(): x(0), y(1) {}
};

int main(){
	Int n;
	cin >> n;
	std::vector<rational> vec(n);
	RC(i, n){
		std::string a;
		cin >> a;
		int x = a.find_first_of('.');
		if(x != -1){
			RC(j, a.substr(x + 1).size()){
				vec[i].y *= 10;
			}
			vec[i].x = std::stoll(a.substr(0, x)) * vec[i].y + std::stoll(a.substr(x + 1));
		}else{
			vec[i].x = std::stoll(a);
		}
	}
	RC(i, n){
		Int tmp = std::gcd(vec[i].x, vec[i].y);
		vec[i].x /= tmp;
		vec[i].y /= tmp;
	}
	// RC(i, n) cout << vec[i].x << " " << vec[i].y << endl;

	std::vector<std::pair<int, int>> tf(n);
	Int cnt[112][112] = {};

	RC(i, n){
		Int tmp = vec[i].x;
		int two = 0, five = 0;
		while(tmp % 2 == 0){
			++two;
			tmp /= 2;
		}
		while(tmp % 5 == 0){
			++five;
			tmp /= 5;
		}
		tmp = vec[i].y;
		while(tmp % 2 == 0){
			--two;
			tmp /= 2;
		}
		while(tmp % 5 == 0){
			--five;
			tmp /= 5;
		}
		tf[i].first = two;
		tf[i].second = five;
		++cnt[two + 50][five + 50];
	}
	RCH(i, 110) RCH(j, 110){
		cnt[i][j] += cnt[i][j + 1];
	}
	RCH(i, 110) RCH(j, 110){
		cnt[i][j] += cnt[i + 1][j];
	}
	/*
	ARC(i, 40, 60){
		ARC(j, 40, 60){
			cout << cnt[i][j] << " ";
		}
		cout << endl;
	}
	*/
	Int ans = 0;
	RC(i, n){
		ans += cnt[50 - tf[i].first][50 - tf[i].second];
		if(tf[i].first >= 0 && tf[i].second >= 0){
			--ans;
		}
	}
	cout << ans / 2 << endl;
}


Measured memory_bytes: 7928