#include<bits/stdc++.h>
using namespace std;

//#define ONLINE
#ifndef ONLINE
char DEBUG_BUFFER[1000];
#define debug(...) {sprintf(DEBUG_BUFFER,##__VA_ARGS__);\
cerr<<"\033[1;36m"<<DEBUG_BUFFER<<"\033[0;2m"<<"\033[0m";}
#else
#define debug(...) ;
#endif

using LL=long long;
using PII=pair<int,int>;

#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()

#define FAST_IO {ios::sync_with_stdio(false);cin.tie(nullptr);}
inline int read(){static int x; cin>>x; return x;}
inline LL readLL(){static LL x; cin>>x; return x;}
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

namespace FMF{ //find-max-factor
	using big=__int128_t;
	LL gcd(LL a,LL b){
		return b?gcd(b,a%b):a;
	}
	LL ksm(LL a,LL b,LL p){
		a%=p; LL res=1;
		while(b){
			if(b&1) res=(big)res*a%p;
			a=(big)a*a%p;
			b>>=1;
		}
		return res;
	}
	bool Miller_Rabin(LL p){ //判断素数
		if(p<2) return 0;
		if(p==2 || p==3 || p==5 || p==7 || p==43) return 1;
		LL d=p-1,r=0;
		while(!(d&1)) ++r,d>>=1; //将d处理为奇数
		for(LL k=0;k<10;k++) {
			LL a=rng()%(p-2)+2;
			LL x=ksm(a,d,p);
			if(x==1 || x==p-1) continue;
			for(int i=0;i<r-1;i++){
				x=(big)x*x%p;
				if(x==p-1) break;
			}
			if(x!=p-1) return 0;
		}
		return 1;
	}
	LL Pollard_Rho(LL x){
		LL s=0,t=0,c=rng()%(x-1)+1;
		int step=0,goal=1;
		LL val=1;
		for(goal=1;;goal<<=1,s=t,val=1){ //倍增优化
			for(step=1;step<=goal;step++){
				t=((big)t*t+c)%x;
				val=(big)val*abs(t-s)%x;
				if((step%127)==0){
					LL d=gcd(val,x);
					if(d>1) return d;
				}
			}
			LL d=gcd(val,x);
			if(d>1) return d;
		}
	}
	LL max_factor;
	void fac(LL x){
		if(x<=max_factor || x<2) return;
		if(Miller_Rabin(x)){ //如果x为质数
			max_factor=max(max_factor,x); //更新答案
			return;
		}
		LL p=x;
		while(p>=x) p=Pollard_Rho(x);  //使用该算法
		while((x%p)==0) x/=p;
		fac(x),fac(p); //继续向下分解x和p
	}
}

#define N 1000010
bool notP[N]; int phi[N],mn_p[N];
vector<int>prime;
void init_prime(const int& n=N){//init [1,n-1]
	phi[1]=mn_p[1]=notP[1]=1;
	for(int i=2;i<n;i++){
		if(!notP[i]){
			prime.push_back(mn_p[i]=i);
			phi[i]=i-1;
		}
		for(const int& p:prime){
			if(i>(n-1)/p) break;
			notP[i*p]=1,mn_p[i*p]=p;
			if(i%p==0){
				phi[i*p]=phi[i]*p;
				break;
			}
			phi[i*p]=phi[i]*(p-1);
		}
	}
}

void solve(){
	LL n=readLL(); //n是待分解的大数
	while(n>=N){ //N是用筛法筛的质数的范围
		FMF::max_factor=0;
		FMF::fac(n);
		LL d=FMF::max_factor;
		int cnt=0;
		while(n%d==0){
			n/=d;
			if(++cnt>=2){
				cout<<"yes\n";
				return;
			}
		}
	}
	while(n!=1){
		int d=mn_p[n],cnt=0;
		while(n%d==0){
			n/=d;
			if(++cnt>=2){
				cout<<"yes\n";
				return;
			}
		}
	}
	cout<<"no\n";
}
int main(){
	FAST_IO;
	init_prime();
	for(int T=read();T--;) solve();
	return 0;
}

/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/