#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }

template <typename I>
struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I>
static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' ';
  return o << ']';
}
template <typename I>
struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I>
static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n';
  repeat(i,(f.n)) {
    repeat(j,f.m) o<<f.p[i][j]<<' ';
    o<<'\n';
  }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);



//


int N;
array<ll, 2> A[200010];

//

ll count_division(ll n, ll d) {
  if (n <= 0) return 0;
  int cnt = 0;
  while (n%d == 0) {
    n /= d;
    ++cnt;
  }
  return cnt;
}


int sum[51][31][51][31];

int main() {
  scanner >> N;
  // assert(count_division(50, 5) == 2);
  // assert(count_division(50, 2) == 1);
  // assert(count_division(50, 7) == 0);
  
  vector<array<int, 4>> vecs;
  vecs.reserve(N);
  
  ll num_de1 = 0;
  ll total = 0;
  repeat(i, N) {
    
    // begin read
    string s; scanner >> s;
    s.push_back(',');
    int j = 0;
    ll nu = 0, de = 1;
    while('0' <= s[j]) {
      nu *= 10;
      nu += s[j]-'0';
      ++j;
    }
    if (s[j] != ',') {
      ++j;
      while('0' <= s[j]) {
        nu *= 10;
        nu += s[j]-'0';
        de *= 10;
        ++j;
      }
    }
    ll g = gcd(nu, de);
    nu /= g;
    de /= g;
    // end read
    // LOG << nu << '/' << de;
    
    // 考察: denominatorを素因数分解すると2,5しか現れない
    //       10を掛け続けることで整数になることが保証されるため
    // 成分を数えておく
    int nu2 = count_division(nu, 2);
    int nu5 = count_division(nu, 5);
    int de2 = count_division(de, 2);
    int de5 = count_division(de, 5);
    // LOG << "2:" << nu2 << " 5:" << nu5 << '/' << "2:" << de2 << " 5:" << de5;
    
    // 愚直
    // for (const auto& v : vecs) {
    //   ll n2 = v[0];
    //   ll n5 = v[1];
    //   ll d2 = v[2];
    //   ll d5 = v[3];
    //   if (nu2 >= d2 && nu5 >= d5 && n2 >= de2 && n5 >= de5)
    //   // if (nu2 >= d2 && nu5 >= d5 && de2 <= n2 && de5 <= n5)
    //     total += 1;
    // }
    vecs.push_back({nu2, nu5, de2, de5});
    
    // 
    ++sum[de2][de5][nu2][nu5];
    num_de1 += de == 1;
    // LOG << de2 << ' ' << de5 << ' ' << nu2 << ' ' << nu5;
  }
  repeat(i2, 50) repeat(i5, 30) rrepeat(j2, 50) rrepeat(j5, 30)
    sum[i2][i5][j2][j5] += sum[i2][i5][j2][j5+1];
  repeat(i2, 50) repeat(i5, 30) rrepeat(j2, 50) rrepeat(j5, 30)
    sum[i2][i5][j2][j5] += sum[i2][i5][j2+1][j5];
  repeat(i2, 50) repeat(i5, 30) rrepeat(j2, 50) rrepeat(j5, 30)
    sum[i2][i5+1][j2][j5] += sum[i2][i5][j2][j5];
  repeat(i2, 50) repeat(i5, 30) rrepeat(j2, 50) rrepeat(j5, 30)
    sum[i2+1][i5][j2][j5] += sum[i2][i5][j2][j5];
    
  // repeat(i2, 2) repeat(i5, 2) repeat(j2, 2) repeat(j5, 2)
  //   LOG << i2 << i5 << j2 << j5 << ' ' << sum[i2][i5][j2][j5];
    
  for (const auto& v : vecs) {
    ll n2 = v[0];
    ll n5 = v[1];
    ll d2 = v[2];
    ll d5 = v[3];
    // LOG << n2 << ' ' << n5 << ' ' << d2 << ' ' << d5;
    total += sum[n2][n5][d2][d5];
  }
  total -= num_de1;
  total /= 2;
  
  cout << total << endl;
  
  return 0;
}


Measured memory_bytes: 15996