#include<bits/stdc++.h>
#define int long long
using namespace std;
//Miller Rabin by Magus(very thankful)
const int prime[10]={0,2,3,5,7,11,13,17,19,23};
int fastmul(int x,int y,int mod)
{
	int z=(double)x*y/mod;
	return ((x*y-z*mod)%mod+mod)%mod;
}
int fastpow(int x,int y,int mod)
{
	int ans=1;
	for(;y;y>>=1,x=fastmul(x,x,mod))
	{
		if(y&1)
		{
			ans=fastmul(ans,x,mod);
		}
	}
	return ans;
}
bool miller_rabin(int n)
{
	if(n==1)
	{
		return false;
	}
	for(int i=1;i<=9;i++)
	{
		if(n==prime[i])
		{
			return true;
		}
		if(n<prime[i])
		{
			return false;
		}
		int m=n-1,power=fastpow(prime[i],m,n);
		while(power==1 and !(m&1))
		{
			m>>=1,power=fastpow(prime[i],m,n);
		}
		if(power!=1 and power!=n-1)
		{
			return false;
		}
	}
	return true;
}
//Miller Rabin by Magus(very thankful)
vector<int>prm;
set<int>s;
int q,n,f[1000005];
signed main()
{
	for(int i=2,w;i<=1000000;i++)
	{
		if(!f[i])
		{
			prm.push_back(i);w=i;
			for(;;)
			{
				s.insert(w);
				if(w>1000000000000000000ll/i)break;
				w*=i;
			}
		}
		for(int j=0;j<prm.size()&&i*prm[j]<=1000000;j++)
		{
			f[i*prm[j]]=true;
			if(i%prm[j]==0)break;
		}
	}
	cin>>q;
	while(q--)
	{
		cin>>n;int f=0;
		if(n==2){cout<<"No\n";continue;}
		if(n%2==0){cout<<"Yes\n";continue;}
		for(int i=2,sq;i<n-1;i*=2)
		{
			sq=sqrt(n-i);
			while(sq*sq<n-i)sq++;
			while(sq*sq>n-i)sq--;
			if(s.count(n-i)||miller_rabin(n-i)||(sq*sq==n-i&&miller_rabin(sq))){f=1;break;}
		}
		if(f)cout<<"Yes\n";
		else cout<<"No\n";
	}
}