#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>

using namespace std;
using namespace __gnu_pbds;

typedef
tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> orderedSet;

#define pb push_back
#define F first
#define S second
#define all(a) (a).begin(), (a).end()

#define for1(i0, l0, r0) for (int i0 = l0; i0 < r0; ++i0)
#define for2(i0, l0, r0) for (int i0 = l0; i0 <= r0; ++i0)
#define forn(i0, n0) for (int i0 = 0; i0 < n0; ++i0)
#define forn1(i0, n0) for (int i0 = 1; i0 < n0; ++i0)
#define forr(i0, n0) for (int i0 = n0; i0 >= 0; --i0)
#define forr1(i0, r0, l0) for (int i0 = r0; i0 > l0; --i0)
#define forr2(i0, r0, l0) for (int i0 = r0; i0 >= l0; --i0)

#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define relaxMax(a, b) a = max(a, b)
#define relaxMin(a, b) a = min(a, b)

typedef long long ll;
typedef long double ld;
#define ui unsigned int
#define ull unsigned long long

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef vector<string> vs;

typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;

typedef vector<vi> vvi;
typedef vector<vd> vvd;
typedef vector<vll> vvll;
typedef vector<vb> vvb;

#define vpss vector<pss>
#define vvs vector<vs>
#define vvpii vector<vpii>
#define vvpll vector<vpll>
#define vpt vector<pt>
#define vvvi vector<vvi>
#define vsi vector<set<int>>
#define ss second
#define ff first

#define printvi(arr) for (int x0 : arr) cout << x0 << ' '; cout << '\n';
#define printvll(arr) for (ll x0 : arr) cout << x0 << ' '; cout << '\n';
#define printpair(pair0) cout << pair0.F << ' ' << pair0.S << '\n';
#define printvp(arr) for (auto pair0 : arr) printpair(pair0);
#define initArray(arr, N0, X0) memset(arr, X0, N0 * sizeof(int))
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void init() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //cout.precision(16);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
}

const int N = 1e5 + 1;

void solve() {
    int n;
    cin >> n;
    vector<ll> a0(n), a(n, 1), b(n, 1);
    vb prime(N, 1);
    prime[0] = prime[1] = 0;
    vll primes;
    for1(i, 1, N){
        if (!prime[i]) continue;
        primes.pb(i);
        for (int j = 2 * i; j < N; j += i) prime[j] = 0;
    }
    map<ll, ll> m;
    forn(i, n){
        cin >> a0[i];
        map<ll, int> f;
        ll x = a0[i];
        if (m.count(a0[i])){
            a[i] = a[m[a0[i]]];
            b[i] = a[m[a0[i]]];
            continue;
        }
        m[a0[i]] = i;
        while(true){
            bool flag = false;
            for (ll y : primes){
                if (y * y > x) break;
                while (x % y == 0){
                    f[y] = (f[y] + 1) % 3;
                    x /= y;
                    flag = true;
                }
                if (flag) break;
            }
            if (!flag){
                f[x] = (f[x] + 1) % 3;
                break;
            }
        }
        for (pll p : f){
            forn(j, p.S) a[i] *= p.F;
            forn(j, (3 - p.S) % 3) b[i] *= p.F;
        }

    }
    map<ll, int> cnt;
    forn(i, n) cnt[a[i]]++;
    ll ans = 0;
    set<ll> used;
    forn(i, n){
        if (used.count(a[i])) continue;
        used.insert(a[i]);
        used.insert(b[i]);
        if (a[i] == 1){
            ans++;
            continue;
        }
        ans += max(cnt[a[i]], cnt[b[i]]);
    }
    cout << ans << '\n';
}

bool multitest = false;

int main() {
    init();
    int t = 1;
    if (multitest) cin >> t;
    forn(i, t) solve();
}

Measured memory_bytes: 33992