#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
const ll INFL = 1LL << 60;//10^18 = 2^60
const int INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;

vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};

//デバッグ
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}
ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};


ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}


//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}

//エラトステネスの篩O(n);
ll prime[100010];//i番目の素数
bool is_prime[100011];
//n以下の素数の個数を全て返す関数
ll sieve(ll n){
    ll p = 0;
    for(ll i = 0; i <= n; i++) is_prime[i] = true;
    is_prime[0] = false;
    is_prime[1] = false;
    for(ll i = 2; i <= n; i++){
        if(is_prime[i]){
            prime[p++] = i;
            for(int j = 2 * i; j <= n; j += i) is_prime[j] = false;
        }
    }
    return p;
}


/*
\(100000^2 * 100001^1 * 1000000007)
\()の中身
素数
素数かける素数
素数二乗
これのpair
2^2 3^1 2000^1 *
*/
ll N;
vector<ll> S;
const ll M = 10000000000;
void solve(){
  sieve(100005);
  vector<ll> p2, p3;
  set<ll> x2;
  map<ll, ll> root;
  for(ll i = 2; i * i * i <= M; i++){
    if(is_prime[i] == 0) continue;
    p3.pb(i*i*i);
  }
  for(ll i = 2; i * i <= M; i++){
    if(is_prime[i] == 0) continue;
    p2.pb(i*i);
    x2.insert(i*i);
    root[i*i] = i;
  }

  vector<ll> A(N), B(N, -1);
  rep(i, N){
    ll s = S[i];
    rep(j, p3.size()){
      while(s % p3[j] == 0){
        s /= p3[j];
      }
    }
    A[i] = s;
    if(A[i] == 1){
      continue;
    }
    ll t = 1;
    rep(j, p3.size()){
      if(t == INFL) break;
      if(s % p2[j] == 0){
        s /= p2[j];
        t *= prime[j];
        if(t > M) t = INFL;
      }else if(s % prime[j] == 0){
        s /= prime[j];
        t *= p2[j];
        if(t > M) t = INFL;
      }
    }
    if(s == 1){
      B[i] = t;
      continue;
    }
    if(t == INFL){
      B[i] = t;
      continue;
    }
    bool l = 0;
    if(x2.count(s)){
      t *= root[s];
      if(t > M) t = INFL;
      l = 1;
    }
    if(l == 0){
      if(t == INFL){
        continue;
      }
      if(t <= M / s * 100) t *= s;
      else t = INFL;
      if(t > M) t = INFL;
      if(t == INFL){
        continue;
      }
      if(t <= M / s * 100) t *= s;
      else t = INFL;
      if(t > M) t = INFL;
    }
    B[i] = t;
  }

  ll e = 0;
  map<ll, ll> MS;
  for(ll i = 0; i < N; i++){
    if(A[i] == 1)e++;
    else{
      MS[A[i]]++;
    }
  }
  ll ans = 0;
  if(e != 0) ans++;
  for(ll i = 0; i < N; i++){
    if(A[i] == 1) continue;
    ll cntx = MS[A[i]];
    ll cnty = MS[B[i]];
    ans += max(cntx, cnty);
    MS[A[i]] = 0;
    MS[B[i]] = 0;
  }
  cout << ans << endl;
}

int main(){
  cin >> N;
  S.resize(N);
  rep(i, N) cin >> S[i];
  solve();
}


Measured memory_bytes: 14208