#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>

mt19937_64 rd(345932498);
const int mod = 1e9 + 7;
const int mod1 = 1e9 + 3;

void solve() {
    int n;
    cin >> n;

    vector<ll> a(n);
    vector<ll> b(n);
    for (int i = 0; i < n; i++) {
        string s; cin >> s;
        for (auto x : s) {
            a[i] = (a[i] * 10 + (x - '0')) % mod;
            b[i] = (b[i] * 10 + (x - '0')) % mod1;
        }
    }

    int res = 0;
    map<pair<ll, ll>, int> mp;
    for (int i = 0; i < n; i++) mp[{a[i], b[i]}]++;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            res += mp[{a[i] * 1ll * a[j] % mod, b[i] * b[j] % mod1}];
        }
    }
    cout << res << '\n';
}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    // cout << powl(1 - 1 / 1e9, 3e7) << '\n';
    int t = 1;
    while (t--) solve();
    return 0;
}
/*
g++ -std=c++20 1.cpp -o 1 && 1 < in.txt > out.txt
*/