#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

const int MAXC = 1000000;
const int MAXQ = 1000;

vector<int> factor[MAXC + 1];
int vis[MAXC + 1], app[MAXC + 1];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        int x;
        cin >> x;
        app[x] = 1;
    }
    ll ans = 0;
    for (int q = 1; q <= MAXQ; ++q)
        for (int p = q + 1; p <= MAXQ; ++p) {
            if (gcd(p, q) > 1) continue;
            for (int t = 1; p * p * t <= MAXC; ++t) {
                if (app[q * q * t] && app[p * q * t] && app[p * p * t]) {
                    ++ans;
                }
            }
        }
    /*for (int i = 1; i <= MAXC; ++i) {
        for (int j = i; j <= MAXC; j += i)
            factor[j].pb(i);
    }*/
    /*for (int i = 1; i <= 999000; ++i) {
        if (!app[i]) continue;
        for (int j = 1; j < SZ(factor[i]); ++j)
            if (factor[i][j] <= 1000)
                for (int k = j - 1; k >= 0; --k) {
                    // factor[i][k] / factor[i][j]
                    //if ((ll)factor[i][k] * factor[i][j] > MAXC) break;
                    int ai = i / factor[i][j] * factor[i][k];
                    if (vis[ai] == i || !app[ai]) continue;
                    ll ak = (ll)i / factor[i][k] * factor[i][j];
                    if (ak > MAXC) break;
                    vis[ai] = i;
                    if (app[ak]) ++ans;
                }
    }*/

    cout << ans << "\n";
}