#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
ostream &operator<<(ostream &os, pair<ll, ll>&p){
  return os << p.first << " " << p.second;
}  
vector<ll>prime_list;
vector< bool > prime_table(ll n) {
  vector< bool > prime(n + 1, true);
  if(n >= 0) prime[0] = false;
  if(n >= 1) prime[1] = false;
  for(ll i = 2; i * i <= n; i++) {
    if(!prime[i]) continue;
    for(ll j = i + i; j <= n; j += i) {
      prime[j] = false;
    }
  }
  return prime;
}

vector<P>factoring(ll &n){
  vector<P>ret;
  rep(i,0,prime_list.size()){
    ll cnt=0;
    if(prime_list[i]>=3000)break;
    while(n%prime_list[i]==0){
      cnt++;
      n/=prime_list[i];
    }
    if(cnt%3>=1)ret.EB(i,cnt%3);
  }
  return ret;
}
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  auto p=prime_table(100000);
  rep(i,0,p.size())if(p[i])prime_list.PB(i);
  map<ll,ll>sq;
  map<ll,ll>pr;
  rep(i,0,prime_list.size())sq[prime_list[i]*prime_list[i]]=i;
  rep(i,0,prime_list.size())pr[prime_list[i]]=i;
  ll n;cin>>n;
  vector<ll>s(n);
  rep(i,0,n)cin>>s[i];
  map<vector<P>,ll>mp;
  rep(i,0,n){
    ll x=s[i];
    auto v=factoring(x);
    if(x!=1){
      if(sq.count(x)){
        v.EB(sq[x],2);
        mp[v]++;
      }
      else if(pr.count(x)){
        v.EB(pr[x],1);
        mp[v]++;
      }
      else res++;
    }
    else if(v.size()==0)buf++;
    else mp[v]++;
  }
  for(auto itr=mp.begin();itr!=mp.end();itr++){
    auto tmp=itr->fi;
    rep(i,0,tmp.size())tmp[i].se=3-tmp[i].se;
    if(mp.count(tmp)){
      res+=max(mp[tmp],itr->se);
      mp.erase(tmp);
    }
    else res+=itr->se;
  }
  cout<<res+(buf>=1)<<endl;
  return 0;
}

Measured memory_bytes: 13568