// {{{ by shik
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <unistd.h>
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP1(i,a,b) for ( int i=(a); i<=int(b); i++ )
#define FOR(it,c) for ( auto it=(c).begin(); it!=(c).end(); it++ )
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

#ifdef SHIK
template<typename T>
void _dump( const char* s, T&& head ) { cerr<<s<<"="<<head<<endl; }

template<typename T, typename... Args>
void _dump( const char* s, T&& head, Args&&... tail ) {
    int c=0;
    while ( *s!=',' || c!=0 ) {
        if ( *s=='(' || *s=='[' || *s=='{' ) c++;
        if ( *s==')' || *s==']' || *s=='}' ) c--;
        cerr<<*s++;
    }
    cerr<<"="<<head<<", ";
    _dump(s+1,tail...);
}

#define dump(...) do { \
    fprintf(stderr, "%s:%d - ", __PRETTY_FUNCTION__, __LINE__); \
    _dump(#__VA_ARGS__, __VA_ARGS__); \
} while (0)

template<typename Iter>
ostream& _out( ostream &s, Iter b, Iter e ) {
    s<<"[";
    for ( auto it=b; it!=e; it++ ) s<<(it==b?"":" ")<<*it;
    s<<"]";
    return s;
}

template<typename A, typename B>
ostream& operator <<( ostream &s, const pair<A,B> &p ) { return s<<"("<<p.first<<","<<p.second<<")"; }
template<typename T>
ostream& operator <<( ostream &s, const vector<T> &c ) { return _out(s,ALL(c)); }
template<typename T, size_t N>
ostream& operator <<( ostream &s, const array<T,N> &c ) { return _out(s,ALL(c)); }
template<typename T>
ostream& operator <<( ostream &s, const set<T> &c ) { return _out(s,ALL(c)); }
template<typename A, typename B>
ostream& operator <<( ostream &s, const map<A,B> &c ) { return _out(s,ALL(c)); }
#else
#define dump(...)
#endif

template<typename T>
void _R( T &x ) { cin>>x; }
void _R( int &x ) { scanf("%d",&x); }
void _R( long long &x ) { scanf("%" PRId64,&x); }
void _R( double &x ) { scanf("%lf",&x); }
void _R( char &x ) { scanf(" %c",&x); }
void _R( char *x ) { scanf("%s",x); }

void R() {}
template<typename T, typename... U>
void R( T& head, U&... tail ) {
    _R(head);
    R(tail...);
}

template<typename T>
void _W( const T &x ) { cout<<x; }
void _W( const int &x ) { printf("%d",x); }
template<typename T>
void _W( const vector<T> &x ) {
    for ( auto i=x.cbegin(); i!=x.cend(); i++ ) {
        if ( i!=x.cbegin() ) putchar(' ');
        _W(*i);
    }
}

void W() {}
template<typename T, typename... U>
void W( const T& head, const U&... tail ) {
    _W(head);
    putchar(sizeof...(tail)?' ':'\n');
    W(tail...);
}

#ifdef SHIK
#define FILEIO(...)
#else
#define FILEIO(name) do {\
    freopen(name ".in","r",stdin); \
    freopen(name ".out","w",stdout); \
} while (0)
#endif

// }}}

const int N=1e5+10;

bitset<N> p_tbl;
vector<int> primes;
void sieve() {
    p_tbl[1]=1;
    for ( int i=2; i<N; i++ ) {
        if ( !p_tbl[i] ) primes.push_back(i);
        for ( int p:primes ) {
            int x=i*p;
            if ( x>=N ) break;
            p_tbl[x]=1;
            if ( i%p==0 ) break;
        }
    }
}

int n;
uint64_t a[N],b1[N],b2[N];
int main() {
    sieve();
    R(n);
    REP(i,n) scanf("%llu",a+i);
    sort(a,a+n);
    // n=10000;
    // REP(i,n) a[i]=1; //rand();
    REP(i,n) {
        if ( i>0 && a[i]==a[i-1] ) {
            b1[i]=b1[i-1];
            b2[i]=b2[i-1];
            continue;
        }
        if ( i%1000==0 ) dump(i);
        VI f;
        uint64_t x1=1,x2=1;
        for ( int p:primes ) {
            if ( 1ULL*p*p>a[i] ) break;
            if ( a[i]%p!=0 ) continue;
            a[i]/=p;
            int x=1;
            while ( a[i]%p==0 ) {
                x++;
                a[i]/=p;
            }
            x%=3;
            REP(j,x) x1*=p;
            REP(j,(3-x)%3) x2*=p;
        }
        if ( a[i]!=1 ) {
            x1*=a[i];
            x2*=a[i]*a[i]; // overflow :D
        }
        b1[i]=x1;
        b2[i]=x2;
    }
    map<uint64_t,int> mp;
    REP(i,n) mp[b1[i]]++;
    int ans=0;
    REP(i,n) {
        if ( b1[i]!=b2[i] && tie(mp[b1[i]],b1[i])>tie(mp[b2[i]],b2[i]) ) ans++;
    }
    if ( mp[1] ) ans++;
    W(ans);
    return 0;
}


Measured memory_bytes: 15104