#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{
    long long start_, end_, step_;
   public:
    struct range_iterator{
      long long val, step_;
      range_iterator(long long v, long long step) : val(v), step_(step) {}
      long long operator * (){return val;}
      void operator ++ (){val += step_;}
      bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;}
    };
    range(long long len) : start_(0), end_(len), step_(1) {}
    range(long long start, long long end) : start_(start), end_(end), step_(1) {}
    range(long long start, long long end, long long step) : start_(start), end_(end), step_(step) {}
    range_iterator begin(){ return range_iterator(start_, step_); }
    range_iterator   end(){ return range_iterator(  end_, step_); }
  };

  string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){
    stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();
  }

  string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }

}

constexpr long long mod = 9_ten + 7;


vector<long long> Eratosthenes(long long N){
  vector<bool> v(N+1, true);
  v[0] = v[1] = false;
  long long sqN = sqrt(N);
  for(int i=2; i<=sqN; i++){
    if(v[i] == false) continue;
    for(long long j=i*i; j<=N; j+=i){
      v[j] = false;
    }
  }
  vector<long long> Prime;
  for(long long i=2; i<=N; i++){
    if(v[i]==true) Prime.push_back(i);
  }
  return Prime;
}


int main(){
  int n;
  cin >> n;
  vector<long long> v(n);
  for(int i=0; i<n; i++){
    scanf("%lld", &v[i]);
  }
  auto P = Eratosthenes(100000);

  map<long long, long long> square;
  for(auto p : P){
    square[p*p] = p;
  }

  vector<long long> cube;
  for(long long i=2; i*i*i <= 10_ten; i++){
    cube.push_back(i*i*i);
  }

  vector<long long> vp(n, 1);
  vector<long long> vc(n, 0);
  vector<long long> vk(n, 0);

  long long ans = 0;
  bool zero = false;
  vector<pair<int,long long>> u;

  for(auto i : range(n)){
    for(auto c : cube){
      while( v[i] % c == 0 ){
        v[i] /= c;
      }
    }
  }

  for(auto i : range(n) ){
    if(v[i] == 1) zero = true;
    else u.push_back({i, v[i]});
  }

  if(zero) ans++;


  for(auto p : P){
    if( p >= 2155 ) break;
    if(u.size() == 0) break;
    vector<pair<int,long long>> u_;
    for(auto& x : u){
      if(x.second % p != 0){
        u_.push_back( x );
        continue;
      }

      int cnt = 0;
      while(x.second % p == 0){
        x.second /= p;
        cnt++;
      }

      if(cnt%3 != 0){
        if(cnt%3 == 2) vk[x.first] |= 1LL << (vc[x.first]);
        vp[x.first] *= p;
        vc[x.first] ++;
      }

      if(x.second != 1){
        u_.push_back(x);
      }
    }

    swap(u, u_);
  }

  for(auto& x : u){
    if( square.count(x.second) ){
      vk[x.first] |= 1LL << (vc[x.first]);
      vp[x.first] *= ( square[x.second] );
      vc[x.first]++;
    }else{
      vp[x.first] *= ( x.second );
      vc[x.first]++;
    }
  }

  map<pair<long long, long long>, map<long long, long long>> G;

  for(int i=0; i<n; i++){
    if(vc[i] == 0) continue;
    G[ {vp[i], vc[i]} ][ vk[i] ] += 1;
  }

  for(auto& ps : G){
    set<long long> used;
    for(auto& pr : ps.second){
      if( used.count( pr.first ) ) continue;
      auto inv = (~pr.first) & ((1LL<<ps.first.second) - 1);

      if( ps.second.count( inv ) == 0 ){
        ans += pr.second;
      }else{
        ans += max(pr.second, ps.second[inv]);
        used.insert(inv);
      }
    }
  }

  println(ans);

  return 0;
}


Measured memory_bytes: 23000