#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl

using namespace std;

template<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<"{"<<p.fi<<","<<p.se<<"}";}
template<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<" ";return o;}
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<" ",q.pop();return o;}
template<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<" ";return o;}
template<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<" ";return o;}
void ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<" ";ashow(a...);}
template<typename S,typename T,typename U>
struct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}};
template<typename S,typename T,typename U>
auto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<"{"<<t.fi<<","<<t.se<<","<<t.th<<"}";}

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef TRI<int, int, int> tri;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<string> vs;

const int MAX_N = 100005;

ll s[MAX_N];

vector<int> prime;
bool is_prime[MAX_N+1];

void sieve(int n){
	for(int i=0;i<=n;i++){
		is_prime[i] = true;
	}
	is_prime[0] = is_prime[1] = false;
	for(int i=2;i<=n;i++){
		if(is_prime[i]){
			prime.push_back(i);
			for(int j=2*i;j<=n;j+=i){
				is_prime[j] = false;
			}
		}
	}
}

map<vector<pll>, int> mp;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    rep(i,n){
        cin >> s[i];
    }
    int m = 2155, cnt = 0;
    sieve(m);
    rep(i,n){
        ll num = s[i];
        vector<pll> vec;
        each(val, prime){
            cnt = 0;
            while(num > 0 && num % val == 0){
                num /= val;
                cnt++;
            }
            cnt %= 3;
            if(cnt){
                vec.pb(pll(val, cnt));
            }
        }
        if(num > 1){
            if(num <= MAX_N){
                vec.pb(pll(num, 1));
            }else{
                ll hoge = (ll)floor(sqrt(num));
                bool flag = false;
                for(ll j = hoge-2; j <= hoge+2; ++j){
                    if(j*j == num){
                        flag = true;
                        vec.pb(pll(j, 2));
                    }
                }
                if(!flag){
                    vec.pb(pll(num, -1));
                }
            }
        }
        mp[vec]++;
    }
    int ans = 0, ans2 = 0;
    each(v, mp){
        if(len(v.fi) == 0){
            ans++;
            continue;
        }
        if(v.fi.back().se < 0){
            ans += v.se;
            continue;
        }
        vector<pll> gyaku;
        each(p,v.fi){
            gyaku.pb(pll(p.fi, 3-p.se));
        }
        auto it = mp.find(gyaku);
        if(it != mp.end()){
            ans2 += max(v.se, it->se);
        }else{
            ans += v.se;
        }
    }
    cout << ans + ans2/2 << "\n";
    return 0;
}


Measured memory_bytes: 15488