#include #include using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair; using pdd = pair; using pll = pair; using pli = pair; using pil = pair; template using Graph = vector>; const int MOD1 = 998244353; const int MOD2 = 1000000007; const ld PI = acos(-1); int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vector a(n); for (int i = 0; i < n; ++i) { cin >> a[i]; } int ma = 1000000; vector isprime(ma + 1, true); vector pr(ma + 1, 1); isprime[0] = isprime[1] = false; for (int i = 2; i <= ma; ++i) { if (!isprime[i]) continue; pr[i] = i; if (i * i <= ma) { for (int j = 2 * i; j <= ma; j += i) { isprime[j] = false; if (pr[j] == 1) pr[j] = i; } } } unordered_map mp; { int cnt = 0; for (int i = 2; i <= ma; ++i) { if (isprime[i]) { mp[i] = cnt++; } } } vector inv1(ma + 1), inv2(ma + 1); inv1[1] = inv2[1] = 1; for (int i = 2; i <= ma; ++i) { inv1[i] = MOD1 - (MOD1 / i) * inv1[MOD1 % i] % MOD1; inv2[i] = MOD2 - (MOD2 / i) * inv2[MOD2 % i] % MOD2; } unordered_map mp2; vector cnt(mp.size()); ll m1 = 1, m2 = 1; mp2[(m1 << 30) | m2] = 1; ll ans = 0; for (int i = 0; i < n; ++i) { while (a[i] != 1) { int tmp = pr[a[i]]; int idx = mp[tmp]; if (cnt[idx]) { (m1 *= inv1[tmp]) %= MOD1; (m2 *= inv2[tmp]) %= MOD2; cnt[idx] = 0; } else { (m1 *= tmp) %= MOD1; (m2 *= tmp) %= MOD2; cnt[idx] = 1; } a[i] /= tmp; } ans += mp2[(m1 << 30) | m2]; mp2[(m1 << 30) | m2]++; } cout << ans << endl; return 0; }