#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
//#define MOD 1000000007LL
#define MOD 998244353LL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,n) for(lint i=0;i<lint(n);++i)
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};

map<lint,lint>prime_factor(lint n){
    auto is_prime=[](lint n){
        if(n<=1)return 0;
        if(n==2)return 1;
        if(n%2==0)return 0;
        lint s=0,d=n-1;
        while(d%2)d/=2,s++;
        auto mod_pow=[](__int128_t a,__int128_t b,__int128_t n){
            lint res=1;
            while(b){
                if(b%2)res=res*a%n;
                a=a*a%n;
                b/=2;
            }
            return lint(res);
        };
        for(lint e:{2,3,5,7,11,13,17,19,23,29,31,37}){
            if(n<=e)break;
            lint ap=mod_pow(e,d,n);
            if(ap==1||ap==n-1)continue;
            bool b=1;
            for(int i=0;i<s;i++){
                if((ap=(__int128_t)ap*ap%n)==n-1){
                    b=0;
                    break;
                }
            }
            if(b)return 0;
        }
        return 1;
    };
    map<lint,lint>v;
    function<void(lint,lint&)> f=[&](lint n,lint& c)->void{
        if(n==1)return;
        if(n%2==0){
            v[2]++;f(n/2,c);
            return;
        }
        if(is_prime(n)){
            v[n]++;
            return;
        }
        while(1){
            lint x=2,y=2,d=1;
            while(d==1){
                x=((__int128_t)x*x+c)%n;
                y=((__int128_t)y*y%n+c)%n;
                y=((__int128_t)y*y%n+c)%n;
                d=gcd(abs(x-y),n);
            }
            if(d==n){
                c++;
                continue;
            }
            f(d,c);
            f(n/d,c);
            return;
        }
    };
    lint c=1;
    f(n,c);
    return v;
}

int main(){
    lint n;
    cin>>n;
    vec a(n);
    rep(i,n)cin>>a[i];
    vector<map<lint,lint>>m(n);
    map<lint,lint>m2,m3;
    rep(i,n){
        m[i]=prime_factor(a[i]);
        lint tmp=1,tmp2=1;
        for(auto& e:m[i]){
            e.second%=3;
            rep(j,e.second){
                tmp*=e.first;
            }
            rep(j,(3-e.second)%3){
                tmp2*=e.first;
            }
        }
        m2[tmp]++;
        m3[tmp]=tmp2;
    }
    lint ans=0;
    set<lint>s;
    for(auto e:m2){
        if(e.first==1){
            ans++;
            continue;
        }
        if(s.count(e.first))continue;
        ans+=max(e.second,m2[m3[e.first]]);
        s.insert(m3[e.first]);
    }
    cout<<ans<<endl;
}

Measured memory_bytes: 50304