#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'


signed main() {
  const ll ma = 10000000000;
  set<ll> cubes;
  for (ll i = 1; i*i*i <= ma; i++) {
    cubes.insert(i*i*i);
  }
  vi primes;
  for (ll i = 2; i*i*i <= ma; i++) {
    ll x = i;
    bool flag = true;
    for (int y = 2; y < x; y++) {
      if (x % y == 0) {
        flag = false;
        break;
      }
    }
    if (flag) primes.push_back(x);
  }
  
  int n;
  cin >> n;
  vl s;
  bool has_cube = false;
  rep (i, n){
    ll x;
    cin >> x;
    if (cubes.count(x)) {
      has_cube = true;
    }
    else {
      s.push_back(x);
    }
  }
  n = s.size();

  //DEBUG_VEC(s);
  
  map<ll, int> mp;
  rep (i, n) {
    for (ll x: primes) {
      if (x > s[i]) break;
      while (s[i] % (x*x*x) == 0) {
        s[i] /= (x*x*x);
      }
    }
    mp[s[i]]++;
  }
  assert(mp.count(0) == 0);
  assert(mp.count(0) == 0);
  //DEBUG_VEC(s);

  /*
  for (auto itr = mp.begin(); itr != mp.end(); itr++) {
    DEBUG(*itr);
  }
  //*/

  ll ans = 0;
  for (auto itr = mp.begin(); itr != mp.end(); itr++) {
    ll x = itr->first;
    ll n1 = itr->second;
    ll y = 1;
    for (ll t: primes) {
      if (t > x) break;
      if (x % (t*t) == 0) {
        x /= t*t;
        if (y > 5 * ma / (t)) {
          y = 0;
          break;
        }
        y *= t;
      }
      else if (x % t == 0) {
        x /= t;
        if (y > 5 * ma / (t * t)) {
          y = 0;
          break;
        }
        y *= t*t;
      }
    }
    if (x > 1) {
      ll sq = (ll)(sqrt(x) + 0.0000000001);
      if (sq*sq == x) {
        if (y > 5 * ma / (sq)) y = 0;
        y *= sq;
      }
      else {
        if (y > (5 * ma / x) / x) y = 0;
        y *= x * x;
      }
    }

    if (mp.count(y)) {
      ans += max(n1, mp[y]);
      mp.erase(y);
    }
    else {
      ans += n1;
    }
  }

  if (has_cube) ans++;
  cout << ans << endl;
}


Measured memory_bytes: 9460