#include<bits/stdc++.h>

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;

#define xx first
#define yy second

template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))

#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof(x.end())i=x.begin();i!=x.end();++i)

struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int &x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char &x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char *x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf &x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf &x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint &x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull &x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char *x){while(*x)P(*x++);RT}
I Fw&OP()(const char *x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;

const int N=100007;
const ll inf=1e18;

bool v[N];
int n,p[N],pm,pc[15];
ll s[N],ot[N],pr[15];

namespace rho
{
	inline ull mrand(){static ull s=124124124713812490;return s+=s<<2|1;}
	inline ll mul(ll a,ll b,ll c){a%=c,b%=c;ll t=a*b-(ll)((llf)a*b/c+0.5)*c;if(t<0)return t+c;return t;}
	inline ll pow(ll a,ll b,ll c){ll r=1;for(;b;b>>=1,a=mul(a,a,c))if(b&1)r=mul(a,r,c);return r;}
	
	std::map<ll,int> ys;
	typedef std::map<ll,int>::iterator iter;
	
	inline bool mr(ll x)
	{
		if(x==2)return 1;
		if(x<2||(~x&1))return 0;
		ll u=x-1,p,a,b;int t=0;
		while(~u&1)u>>=1,t++;
		fo0(i,5)
		{
			p=mrand()%(x-1)+1;
			a=pow(p,u,x);
			fo0(j,t)
			{
				b=mul(a,a,x);
				if(b==1&&a!=1&&a!=x-1)return 0;
				a=b;
			}
			if(a!=1)return 0;
		}
		return 1;
	}
	
	inline ll f(ll a,ll b,ll n)
	{
		return (mul(a,a,n)+b)%n;
	}
	
	void pr(ll n)
	{
		if(n==1)return;
		if(mr(n)){ys[n]++;return;}
		if(n==4){ys[2]+=2;return;}
		ll a,x,y,p;
		while(1)
		{
			a=mrand()&63,x=y=2;
			while(1)
			{
				x=f(x,a,n),y=f(f(y,a,n),a,n);
				if(x==y)break;
				p=gcd(n,abs(x-y));
				if(p>1){pr(p),pr(n/p);return;}
			}
		}
	}
}

int main()
{
	fo(i,2,N-1)
	{
		if(!v[i])p[pm++]=i;
		for(int j=0;i*p[j]<N;j++)
		{
			v[i*p[j]]=1;
			if(i%p[j]==0)break;
		}
	}
	p[pm]=1e8;
	in,n;
	fo1(i,n)
	{
		ll t=in;
		/*int c=0;
		for(int j=0;(ll)p[j]*p[j]<=t;j++)
		{
			if(t%p[j]==0)
			{
				do pc[c]++,t/=p[j];while(t%p[j]==0);
				if(pc[c]%=3)pr[c++]=p[j];else pc[c]=0;
			}
		}
		if(t>1)
		{
			pc[c]=1;
			pr[c++]=t;
		}*/
		rho::ys.clear();
		rho::pr(t);
		ll a=1,b=1;
		foe(i,rho::ys)
		{
			ll x=i->xx;int y=i->yy%3;
			if(y)
			{
				fo0(j,y)a*=x;
				fo0(j,3-y)
				{
					if(inf/b>=x)b*=x;
					else b=inf;
				}
			}
		}
		/*fo0(i,c)
		{
			fo0(j,pc[i])a*=pr[i];
			fo0(j,3-pc[i])
			{
				if(inf/b>=pr[i])b*=pr[i];
				else b=inf;
			}
		}*/
		s[i]=a,ot[i]=b;
		//while(c--)pc[c]=0;
		//out,i,' ',a,' ',b,'\n';
	}
	std::map<ll,int>cnt;
	fo1(i,n)cnt[s[i]]++;
	cnt[1]=1;
	int ans=0;
	fo1(i,n)if(cnt.find(s[i])!=cnt.end())
	{
		ans+=max(cnt[s[i]],cnt[ot[i]]);
		cnt.erase(s[i]);
		cnt.erase(ot[i]);
	}
	out,ans,'\n';
}

Measured memory_bytes: 8192