#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FORR(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
#define show(x) cout<<#x<<" = "<<x<<endl;
#define all(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define bit(n) (1LL<<(n))
#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))
#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))

typedef long long ll;
typedef __int128_t lll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}
template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}
lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll gcd(ll a,ll b){lll x=0,y=0;return gcd(a,b,x,y);}
ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}
void dout(double d){printf("%.12f\n",d);}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());

const int N = 2155;
const ll NN = N*N;
struct Prime{
  vector<ll> pl;
  void init(int a){ // a以下の素数列挙
    pl.resize(0);
    vector<bool> z(a+1, true);
    for(int i=2; i<=a; i++){
      if(z[i])pl.push_back(i);
      for(int b=i*2; b <= a; b+=i) z[b]=false;
    }
  }
  void prime_division(ll a, vector<pair<ll, int>> &v){
    v.resize(0);
    for(ll b: pl){
      if(b*b > a) break;
      if(a%b) continue;
      int c = 0;
      while(a%b==0) a/=b, c++;
      c %= 3;
      if(c) v.push_back(make_pair(b, c));
    }
    if(a>1){
      ll b = (ll)round(sqrt((double)a));
      if(b*b == a){
        v.push_back(make_pair(b, 2));
      }else{
        v.push_back(make_pair(a, 1));
      }
    }
  }
} prime;

int n;
map<lll, int> c;
map<lll, vector<pair<ll, int>>> m;
lll inv(vector<pair<ll, int>> &v){
  lll s = 1;
  each(itr, v) FOR(i, 0, 3-itr->se) s *= itr->fi;
  return s;
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  prime.init(N);
  FOR(t, 0, n){
    ll s;
    cin >> s;
    vector<pair<ll, int>> v;
    prime.prime_division(s, v);
    s = 1;
    each(itr, v) FOR(i, 0, itr->se) s *= itr->fi;
    if(m.find(s) == m.end()) m[s] = v;
    c[s]++;
  }
  ll ans = 0;
  each(itr, m){
    lll s = itr->fi, t = inv(itr->se);
    if(s==1){
      ans++;
      continue;
    }
    if(m.find(t) == m.end()){
      ans += c[s];
    }else{
      ans += max(c[s], c[t]);
      m.erase(t);
    }
  }
  cout << ans << endl;
}

Measured memory_bytes: 23936