#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const int mod=1000000007;
const llint big=1e18+10;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-9;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
uint64_t mulmod(uint64_t a, uint64_t b, uint64_t m) {//a*bmodm
	int64_t res = 0;
	while (a != 0) {
		if (a & 1) {res = (res + b) % m;}
		a >>= 1;b = (b << 1) % m;
	}
	return res;
}
uint64_t bekmod(uint64_t a, uint64_t b, uint64_t m) {//a^bmodm
	int64_t res=1,gen=a;
	while (b!=0) {
		if(b&1){res=mulmod(res,gen,m);}
		gen=mulmod(gen,gen,m);b>>=1;
	}
	return gen;
}
bool isprime(llint n){
	//cout<<"de"<<n<<endl;
	llint gen=n-1,s=0;
	while(gen%2==0){s++;gen/=2;}
	int a[15]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
	for(int i=0;i<15;i++){
		if(a[i]>=n){continue;}
		llint ad=bekmod(a[i],gen,n);
		if(ad==1){continue;}
		int r=0;
		for(r=0;r<s;r++){
			if(ad==n-1){break;}
			ad=mulmod(ad,ad,n);
		}
		if(r!=s){continue;}
		return false;
	}
	return true;
}
bool ispa(llint n){
	
	if(isprime(n)){return true;}
	for(int i=2;i<=50;i++){//q>3
		llint bmax=sqrt(n)+10,bmin=2,gen=9999,now=9999;
		while(bmax-bmin!=1){
			gen=(bmax+bmin)/2;
			now=1;
			for(int j=0;j<i;j++){
				now*=gen;
				if(now>n){break;}
			}
			if(now==n){break;}
			if(now>n){bmax=gen;}
			else{bmin=gen;}
		}
		//genがroot(n,i)の候補
		//llint gen=root(n,i);
		if(pow(gen,i)!=n){continue;}
		if(gen<3){return false;}
		if(isprime(gen)){return true;}
	}
	return false;
}
void solve(void){
	llint n;cin>>n;
	if(n==2){cout<<"No"<<endl;return;}
	if(n%2==0){cout<<"Yes"<<endl;return;}
	for(llint qb=2;qb<n;qb*=2){
		if(ispa(n-qb)){cout<<"Yes"<<endl;return;}
	}
	cout<<"No"<<endl;
}
int main(void){
	int q;cin>>q;
	for(int i=0;i<q;i++){solve();}
	return 0;
}