#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x))
#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE
#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
//const ll MOD = (ll)1e9+7;
const ll MOD = 998244353;
const int INF = (ll)1e9+7;
const ll INFLL = (ll)1e18;
template<class t>
using vvector = vector<vector<t>>;
template<class t>
using vvvector = vector<vector<vector<t>>>;
template<class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}
template<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}
#ifdef DEBUG
#define debug(x) cout<<"LINE "<<__LINE__<<": "<<#x<<" = "<<x<<endl;
#else
#define debug(x) (void)0
#endif

namespace templates{
  ll modpow(ll x, ll b){
    ll res = 1;
    while(b){
      if(b&1)res = res * x % MOD;
      x = x * x % MOD;
      b>>=1;
    }
    return res;
  }

  ll modinv(ll x){
    return modpow(x, MOD-2);
  }

  bool was_output = false;
  template<class t>
  void output(t a){
    if(was_output)cout << " ";
    cout << a;
    was_output = true;
  }
  void outendl(){
    was_output = false;
    cout << endl;
  }
  ll in(){
    ll res;
    scanf("%lld", &res);
    return res;
  }

  template<class t>
  istream& operator>>(istream&is, vector<t>&x){
    for(auto &i:x)is >> i;
    return is;
  }

  template<class t, class u>
  istream& operator>>(istream&is, pair<t, u>&x){
    is >> x.first >> x.second;
    return is;
  }

  template<class t>
  void in(t&x){
    cin >> x;
  }

  template<class t>
  t in(){
    t res; cin >> res; return res;
  }

  template<class t>
  void out(t x){
    cout << x;
  }

  template<class t>
  vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){
    sort(line.begin(),line.end(),comp);
    return line;
  }

  template<class t>
  vector<t> reversed(vector<t> line){
    reverse(line.begin(),line.end());
    return line;
  }
}

using namespace templates;

pii ton(string str){
    pii res(0,0);
    int n = str.size();
    bool flag = false;
    ll sum = 0;
    foreach(i,str){
        if(i=='.'){
            flag = true;
            continue;
        }
        if(flag){
            ++res.first;
            ++res.second;
        }
        sum *= 10;
        sum += i - '0';
    }
    while(sum%2==0){
        --res.first;
        sum /= 2;
    }
    while(sum%5==0){
        --res.second;
        sum /= 5;
    }
    return res;
}

ll func(){
    int n = in();
    vector<pii> needs(n);
    vvector<ll> has(19,vector<ll>(19,0));
    method(got,ll&,int a,int b){
        static ll null = 0;
        a += 9;
        b += 9;
        if(min(a,b)<0 or max(a,b)>=19)return null;
        return has[a][b];
    };

    foreach(i,needs){
        i = ton(in<string>());
    }
    foreach(i,needs){
        if(i.first<-9)i.first=-9;
        if(i.second<-9)i.second=-9;
        ++got(i.first,i.second);
    }
    ll res = 0;
    rep(a1,-9,10){
        rep(b1,-9,10){
            rep(a2,-9,-a1+1){
                rep(b2,-9,-b1+1){
                    res += got(a1,b1) * got(a2,b2);
                }
            }
        }
    }
    foreach(i,needs){
        if(i.first<=0 and i.second <= 0)--res;
    }
    res /= 2;
    return res;
}

int main(){

    cout << func() << endl;
  return 0;
}


Measured memory_bytes: 4768