#include <bits/stdc++.h>
#include <time.h>
#define INF 1000000000LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
std::random_device rd;
std::mt19937 mt(rd());

ll mod_pow(ll x,ll n,ll mod){
	ll res=1;
	while(n>0){
		if(n&1LL)res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}

ll calc(ll v,ll tgt,int po){
	ll ans=1;
	for(int i=0;i<po;i++){
		ans*=v;
		if(ans>tgt)return false;
	}
	if(ans<tgt)return false;
	if(ans>tgt)return false;
	return true;
}

bool is_prime(ll val){
	if(val==1LL)return false;
	if(val==2LL)return true;
	for(int i=0;i<5;i++){
		ll v=rd()%val;
		if(v==0LL)v=1;
		if(mod_pow(v,val-1LL,val)!=1LL)return false;
	}
	return true;
}

bool C(ll v,ll tgt,int po){
	ll res=1;
	while(po>0){
		if(po&1){
			if(log(tgt)+1<(log(res)+log(v)))return false;
			res*=v;
		}
		if(po>1 && log(tgt)+1<(log(v)+log(v)))return false;
		v*=v;
		po>>=1;
	}
	return res<=tgt;
}

bool check(ll val,int po){
	if(po==1)return is_prime(val);
	else{
		ll l=2,r=min(INF,val);
		if(!C(l,val,po))return false;
		while(l+1<r){
			ll mid=(l+r)/2LL;
			if(C(mid,val,po))l=mid;
			else r=mid;
		}
		//printf("%lld %lld %d\n",l,val,po);
		if(calc(l,val,po) && is_prime(l))return true;
		else return false;
	}
}

int main(void){
	int q;
	scanf("%d",&q);
	for(int ub=0;ub<q;ub++){
		ll n;
		scanf("%lld",&n);
		if(n==2LL){
			printf("No\n");
		}else if(n%2LL==0){
			printf("Yes\n");
		}else{
			ll tw=2;
			bool flag=false;
			for(int j=0;j<59;j++){
				ll rest=n-tw;
				if(rest<=0LL)break;
				for(int i=1;i<=59;i++){
					if(check(rest,i)){
						flag=true;
						goto gg;
					}
				}
				tw*=2LL;
			}
			gg:
			printf("%s\n",flag?"Yes":"No");
		}
	}
	return 0;
}