#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
    for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n;
    cin >> n;
    vector<ll> a(n);
    REP(i, n) cin >> a[i];

    // 10^5までの素数を列挙
    const ll lim1 = 2200, lim2 = 100001;
    vector<ll> prime1;
    set<ll> prime2;
    vector<bool> isprime(lim2, true);
    isprime[0] = isprime[1] = false;
    for(ll i=2; i<lim2; ++i) {
        if(!isprime[i]) continue;
        if(i <= lim1) prime1.push_back(i);
        // cout << i << endl;
        prime2.insert(i*i);
        for(ll j=i*2; j<lim2; j+=i) isprime[j] = false;
    }

    // cout << prime1 << endl;
    // ll prod = 1;
    // for(auto i: prime1) prod *= i*i;
    // cout << prod << endl;

    map<ll,ll> cnt;
    set<PII> s;
    REP(i, n) {
        // cout << "i=" << i << " " << a[i] << endl;
        ll b = 1;
        ll t = a[i];
        for(auto p: prime1) {
            while(a[i]%(p*p*p) == 0) a[i] /= p*p*p;
            ll cnt = 0;
            while(t%p == 0) t /= p, cnt++;
            cnt %= 3;
            if(cnt == 1) b *= p*p;
            else if(cnt == 2) b *= p;
        }
        // cout << a[i] << " " << b << " " << t << endl;
        if(prime2.find(t) != prime2.end()) {
            b *= sqrt(t);
        } else {
            if(t <= 100010) b *= t*t;
            else b = -1;
        }
        // cout << b << endl;
        if(a[i]!=1) s.insert({a[i], b}), s.insert({b, a[i]});
        cnt[a[i]]++;
    }

    // for(auto p: cnt) cout << p << endl;

    ll ret = 0;
    for(auto p: s) {
        ret += max(cnt[p.first], cnt[p.second]);
        // cout << p << " " << ret << endl;
    }
    ret /= 2;
    if(cnt.find(1) != cnt.end()) ret++;
    cout << ret << endl;

    return 0;
}


Measured memory_bytes: 22016