#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long

#define all(X) (X).begin(), (X).end()
#define reset(X) memset(X, 0, sizeof(X))
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define endl '\n'
#define fi first
#define se second

using namespace __gnu_pbds;
using namespace std;
const int mod = 1e9 + 7;
// const int mod=998244353;
//const int mod=1e9+9;
//const int INF=4e18+10;
const int INF = 4e18 + 10;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define read(n) \
int n;      \
cin >> n;
#define readv(x, n)   \
vector<int> x(n); \
for (auto &i : x) \
    cin >> i;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;

template <typename T1, typename T2>
void set_min(T1 &a, T2 b)
{
    a = min(a, (T1)b);
}

int multiply(int a, int b, int in_mod) { return (a * b) % in_mod; }
int mult_identity(int a) { return 1; }


auto power(auto a, int b, int in_mod)
{
    auto prod = mult_identity(a);
    auto mult = a % in_mod;
    while (b != 0)
    {
        if (b % 2)
        {
            prod = multiply(prod, mult, in_mod);
        }
        mult = multiply(mult, mult, in_mod);
        b /= 2;
    }
    return prod;
}
int mod_inv(int q, int in_mod)
{

    return power(q, in_mod - 2, in_mod);
}

#define double long double

void solve()
{
    int n;
    cin>>n;
    vector<double> a(n);
    vector<pair<int, int>> overdose;
    for(int i=0;i<n;i++)
    {

        cin>>a[i];
        a[i] *= 1000000000;
        int offset = 1000000000;
        int fake = round(a[i]);

        int den = offset / __gcd(fake, offset);
        fake /= __gcd(fake,offset);

        int temp = den;
        while(temp % 2 == 0)
            temp/=2;
        while(temp % 5 == 0)
            temp/=5;
        if(temp == 1)
        {
            overdose.pb({fake, den});
        }


    }

    int mx_two_power =0, mx_five_power = 0;
    for(auto i:overdose)
    {

        int num = i.fi, den = i.se;

        int two_power_den = 0, five_power_den = 0;
        while(den %2 ==0)
            den/=2 , two_power_den++;
        while(den %5 == 0)
            den/=5 , five_power_den++;

        mx_five_power = max(mx_five_power, five_power_den);
        mx_two_power = max(mx_two_power, two_power_den);

    }

    for(auto &i:overdose)
    {


        int num = i.fi, den = i.se;

        int two_power_den = 0, five_power_den = 0;
        while(den %2 ==0)
            den/=2 , two_power_den++;
        while(den %5 == 0)
            den/=5 , five_power_den++;

        i.fi *= pow(2, max((int)0,mx_two_power - two_power_den ));

        i.fi *= pow(5, max((int)0,mx_five_power - five_power_den ));
    }






    int ans = 0;
    vector<vector<int>> table(80, vector<int>(40)) ;

    for(auto i:overdose)
    {

        int num = i.fi, den = i.se;

        int two_power_num = 0, five_power_num = 0;
        while(num %2 ==0)
            num/=2 , two_power_num++;
        while(num %5 == 0)
            num/=5 , five_power_num++;
        ans += table[max((int)0,2*mx_two_power - two_power_num)][max((int)0,2*mx_five_power -five_power_num)];

        for(int j=0;j<=two_power_num;j++)
        {
            for(int k= 0;k<=five_power_num;k++)
            {
                table[j][k]++;
            }
        }
    }
    cout<<ans<<endl;



}


signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cerr.tie(NULL);
#ifndef ONLINE_JUDGE
    if (fopen("INPUT.txt", "r"))
    {
        freopen("INPUT.txt", "r", stdin);
        freopen("OUTPUT.txt", "w", stdout);
    }
#endif
    auto clk = clock();
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    // -------------------------------------Code starts here---------------------------------------------------------------------

    int t = 1;
    // cin >> t;

    for (int test = 1; test <= t; test++)
    {
        // cout<<"Case #"<<test<<":\n";
        //cout<<"Trip #"<<test<<": ";
        // cout<<endl;
        solve();
        // solveB();

        // cout<<endl;
    }

    // -------------------------------------Code ends here------------------------------------------------------------------

    clk = clock() - clk;
    // cerr << fixed << setprecision(6) << "Time: " << ((long double)clk) / CLOCKS_PER_SEC << "\n";
    return 0;
}


Measured memory_bytes: 10728