/* be name khoda */

// #define stream_enable
#define long_enable
#include <iostream>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;

#ifdef stream_enable
#define cin sss
#endif
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif

typedef pair<ll, ll> pii;
typedef pair<pii, ll> ppi;
typedef pair<ll, pii> pip;
typedef vector<ll> vi;
typedef vector<pii> vpii;

const ll MOD = 1000000007;
const long long BIG = 1446803456761533460;
const int Big = 336860180;

#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()

#define debug(x) cout << #x << " -> " << (x) << endl
#define debug2(x, y) cout << #x << ' ' << #y << " -> " << (x) << ' ' << (y) << endl
#define debug3(x, y, z) cout << #x << ' ' << #y << ' ' << #z << " -> " << (x) << ' ' << (y) << ' ' << (z) << endl
#define debug4(x, y, z, t) cout << #x << ' ' << #y << ' ' << #z << ' ' << #t << " -> " << (x) << ' ' << (y) << ' ' << (z) << ' ' << (t) << endl
#define debugp(x) cout << #x << " -> " << "(" << (x).F << ", " << (x).S << ")" << endl
#define debuga(x, n) cout << #x << " -> "; fori (i1_da, n) { cout << (x)[i1_da] << ' '; } cout << endl
#define debugap(x, n) cout << #x << " ->\n"; fori (i1_dap, n) { cout << "(" << (x)[i1_dap].F << ", " << (x)[i1_dap].S << ")\n"; } cout << endl
#define debugaa(x, n, m) cout << #x << " ->\n"; fori (i1_daa, n) { fori (i2_daa, m) { cout << (x)[i1_daa][i2_daa] << ' '; } cout << '\n'; } cout << endl
#define debugav(x, n) cout << #x << " ->\n"; fori (i1_dav, n) { fori (i2_dav, (x)[i1_dav].size()) { cout << (x)[i1_dav][i2_dav] << ' '; } cout << '\n'; } cout << endl
#define debugia(x, n) cout << #x << " ->\n"; fori (i1_dia, n) { cout << i1_dia << " : " << (x)[i1_dia] << '\n'; } cout << endl

#define forifrom(i, s, n) for(ll i = (s); i < (n); ++i)
#define forirto(i, n, e) for(ll i = (n) - 1; i >= (e); --i)
#define fori(i, n) forifrom (i, 0, n)
#define forir(i, n) forirto (i, n, 0)

#define smin(a, b) a = min(a, (b))
#define smax(a, b) a = max(a, (b))

#define Add(a, b) a = (a + (b)) % MOD
#define Mul(a, b) a = (a * (b)) % MOD

stringstream sss;

// -----------------------------------------------------------------------

const ll maxa1 = 100000000010;
const ll maxa2 = 100010;
const ll maxa3 = 2500;
const ll maxn = 100010;

ll n, s;
ll siv[maxa3], ar[maxn], arr[maxn], rem[maxn];
map<ll, ll> p22p;
map<ll, ll> pairr;
map<ll, ll> cnt;

inline ll safemul(ll a, ll b) {
    return a > maxa1 / b + 1 ? 0 : a * b;
}

void MAIN() {

    cin >> n;
    fori (i, n) cin >> arr[i], rem[i] = arr[i];
    fill(ar, ar + n, 1);

    forifrom (p, 2, maxa3) {
        if (siv[p] == 0) {
            ll p2 = p * p;
            ll p3 = p2 * p;
            for (ll j = p2; j < maxa3; j += p) siv[j] = 1;
            fori (i, n) {
                while (arr[i] % p3 == 0) arr[i] /= p3, rem[i] /= p3;
                if (arr[i] % p2 == 0) {
                    ar[i] = safemul(ar[i], p);
                    rem[i] /= p2;
                } else if (arr[i] % p == 0) {
                    ar[i] = safemul(ar[i], p2);
                    rem[i] /= p;
                }
            }
        }
    }

    fori (i, maxa2) {
        p22p[i * i] = i;
    }

    fori (i, n) {
        if (p22p.count(rem[i])) {
            ar[i] = safemul(ar[i], p22p[rem[i]]);
        } else {
            ar[i] = safemul(ar[i], rem[i]);
            ar[i] = safemul(ar[i], rem[i]);
        }
        pairr[arr[i]] = ar[i];
        pairr[ar[i]] = arr[i];
        ++cnt[arr[i]];
    }

    ll ans = 0;
    fori (i, n) {
        if (cnt[arr[i]] == -1) continue;
        ll a = arr[i];
        if (pairr[a] == a) ++ans;
        else ans += max(cnt[a], cnt[pairr[a]]);
        cnt[a] = -1;
        cnt[pairr[a]] = -1;
    }
    cout << ans << '\n';

}

// -----------------------------------------------------------------------

int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(10);
    sss << R"(
8
1
2
3
4
5
6
7
8
    )";
    MAIN();
    return 0;
}


Measured memory_bytes: 29440