// Original C++ solution (slower):
#include <bits/stdc++.h>

#define mst(a,b) memset(a,b,sizeof(a))

#define lowbit(x) ((x)&(-x))

#define X first

#define Y second

using namespace std;

typedef long long LL;

typedef long long ll;

typedef unsigned long long ull;

typedef pair<int, int> pii;

typedef pair<ll, ll> pll;

//const int mod = 1e9+7;

const int inf = 0x3f3f3f3f;

const ll INF = 0x3f3f3f3f3f3f3f3f;

const int maxn = 100000+10;

const double eps = 1e-9;

//const int maxm = 2510000+10;

bool is_prime[maxn];

int prime[maxn],id[maxn],tot;

ull seed=131;

ull f[maxn];

map<ull,int> cnt;

pair<ull,ull> a[maxn];

void init(){

    is_prime[1]=true;

    f[0]=1;

    for (int i=2;i*i<=100000;i++)

        if (!is_prime[i])

            for (int j=i*i;j<=100000;j+=i) is_prime[j]=true;

    for (int i=1;i<=100000;i++){

        if (!is_prime[i]) {

            prime[tot]=i;

            id[i]=tot++;

        } else id[i]=-1;

        f[i]=f[i-1]*seed;

    }

}

int main() {

#ifdef local

    freopen("in.txt", "r", stdin);

//    freopen("out.txt", "w", stdout);

#endif

    ios::sync_with_stdio(0);

    cin.tie(0);cout.tie(0);

    init();

    int n; cin>>n;

    int ans=0;

    for (int i=0;i<n;i++){

        ll x; cin>>x;

        ull H=0,P=0;

        for (int j=0;j<350 && 1ll*prime[j]*prime[j]<=x;j++){

            if (x%prime[j]==0){

                int c=0;

                while (x%prime[j]==0){

                    c=(c+1)%3;

                    x/=prime[j];

                }

                H+=f[id[prime[j]]]*c;

                P+=f[id[prime[j]]]*((3-c)%3);

            }

        }

        if (x>1){

            if (x<=100000 && !is_prime[x]){

                H+=f[id[x]];

                P+=f[id[x]]*2;

            } else if (x>100000) {

                ll tmp=sqrt(x)+eps;

                if (tmp*tmp==x && !is_prime[tmp]){

                    H+=f[id[tmp]]*2;

                    P+=f[id[tmp]];

                } else {

                    ans++;

                    continue;

                }

            }

        }

        a[i].X=H; a[i].Y=P;

        cnt[H]++;

    }

    if (cnt.count(0)) {

        ans++;

        cnt[0]=0;

    }

    for (int i=0;i<n;i++){

        ull H=a[i].X,P=a[i].Y;

        ans+=max(cnt[H],cnt[P]);

        cnt[H]=0; cnt[P]=0;

    }

    cout<<ans<<"\n";

    return 0;

}


// Optimized solution to the same problem (faster):
/*

 /+==================================================+\

//+--------------------------------------------------+\\

|.|\\...>>>>>>> Hollwo_Pelw(ass) 's code <<<<<<<...//|.|

\\+--------------------------------------------------+//

 \+==================================================+/

*/

#include <bits/stdc++.h>

using namespace std;

// type

typedef long long ll;

typedef long double ld;

// loop

//#define For(i, l, r)        for (int i = l; i < r; i++)

//#define ForE(i, l, r)       for (int i = l; i <= r; i++)

//#define Ford(i, r, l)       for (int i = r; i > l; i--)

//#define FordE(i, r, l)      for (int i = r; i >= l; i--)

//#define Fora(i, a)          for (auto i : a)

// I/O

#define FAST_IO             std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

#define setpre(n)           fixed << setprecision(n)

// pair

#define F                   first

#define S                   second

#define pii                 pair<int, int>

#define pll                 pair<ll, ll>

#define pdd                 pair<ld, ld>

// vector & !!?(string)

#define eb                  emplace_back

#define pb                  push_back

#define all(a)              a.begin(), a.end()

#define rall(a)             a.rbegin(), a.rend()

#define sz(a)               a.size()

#define len(a)              a.length()

// geometry calculate

#define pi                  acos(-1.0)

#define g_sin(a)            sin(a*pi/180)

#define g_cos(a)            cos(a*pi/180)

#define g_tan(a)            tan(a*pi/180)

// set val

#define ms0(a)              memset(a,        0, sizeof(a));

#define ms1(a)              memset(a,        1, sizeof(a));

#define msn1(a)             memset(a,       -1, sizeof(a));

#define msinf(a)            memset(a, 0x3f3f3f, sizeof(a));

// constant

const int mod1 = 998244353, mod = 1e9+7;

const int MAXN = 100005, MAXM = 200010;

// code

#define int long long



map<int, int> cnt, inv;

vector<int> prime;

bool isp[3000];

int n, grp[MAXN];



void Solve() {

    for (int i = 2; i < 3000; i++){

        isp[i] = true;

    }

    for (int i = 2; i < 3000; i++){

        if (isp[i]){

            prime.pb(i);

            for (int j = i*i; j < 3000; j += i){

                isp[j] = false;

            }

        }

    }



    cin >> n;

    for (int i = 0, x; i < n; i++){

        cin >> x;

        for (auto p:prime){

            int k = p*p*p;

            while (x % k == 0) x /= k;

        }

        if (++cnt[x] == 1){

            grp[i] = x, inv[i] = 1;

            for(auto p:prime){

                int k = p*p;

				if(k <= x && x % k == 0){

					inv[i] *= p, x /= k;

				}

				else if(x % p == 0){

					inv[i] *= k, x /= p;

				}

			}

            int xx = sqrt(x);

            if(xx * xx == x){

                inv[i] *= xx;

            }

            else{

                inv[i] *= x*x;

            }

        }

    }

    int ans = (int) (cnt[1] > 0);

    cnt[1] = 0;

    

    for (int i = 0; i < n; i++){

        if (grp[i]){

            ans += max(cnt[grp[i]], cnt[inv[i]]);

            cnt[grp[i]] = cnt[inv[i]] = 0;

        }

    }

    cout << ans;

}



signed main(){

    FAST_IO;

    int TC = 1;

    //cin >> TC;

    while(TC--) Solve();

    return 0;

}

/*



./-=====>>><<<-------- DEBUG -------->>><<<=====-\.

/.................................................\



+====================== INP ======================+





+====================== OUT ======================+





\................................................./

.\-=====>>><<<--------= END =-------->>><<<=====-/.

*/


// Fastest known solution for this problem: