#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

vector<int> sieve(int n) {
    vector<bool> f(n + 1);
    for (int i = 3; i <= n; i += 2) f[i] = 1;
    for (int i = 3; i <= sqrt(n); i += 2) if (f[i]) for (int j = i * 3; j <= n; j += i) f[j] = 0;
    vector<int> res;
    if (n >= 2)res.push_back(2);
    for (int i = 3; i <= n; i += 2) if (f[i]) res.push_back(i);
    return res;
}

ll powMod(__int128 n, ll k, ll mod) {
    if (n == 0)return 0;
    __int128 res = 1;
    while (k) {
        if (k & 1)res = res*n%mod;
        n = n*n%mod;
        k >>= 1;
    }
    return res;
}

bool MillerRabinPrimalityTest(ll n, int precision = 20) {
    static mt19937_64 mt64;
    if (n == 2)return true;
    if (n == 1 || n % 2 == 0)return false;

    ll q = n - 1, k = 0;
    while (!(q & 1)) {
        q >>= 1;
        k++;
    }

    uniform_int_distribution<ll> unirand(1, n - 1);
    for (int i = 0; i < precision; ++i) {
        ll a = unirand(mt64);
        ll aq = powMod(a, q, n);
        if (aq == 1)continue;
        bool flag = true;
        for (int j = 0; j < k; ++j) {
            if (powMod(aq, (1ll << j), n) == n - 1) {
                flag = false;
                break;
            }
        }
        if (flag)return false;
    }

    return true;
}

vi primes;
unordered_set<ll> S;

bool solve(ll N) {
    if (N <= 2)return false;
    if (N % 2 == 0)return true;
    for (ll a = 1; (1ll << a) < N; ++a) {
        ll qb = N - (1ll<<a);
        if (S.count(qb))return true;

        if (MillerRabinPrimalityTest(qb))return true;
        ll sqrt_qb = (ll)sqrt(qb);
        for (ll q = max(3ll, sqrt_qb - 1000); q < sqrt_qb + 1000; ++q) {
            if (q*q == qb && MillerRabinPrimalityTest(q)) return true;
        }
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int Q;
    cin >> Q;
    primes = sieve(1000000);
    each(p, primes) {
        ll a = p;
        for (int i = 2; a*p / p == a && a*p <= (ll)1e18; ++i) {
            a *= p;
            if (i >= 3)S.insert(a);
        }
    }
    while (Q--) {
        ll N;
        cin >> N;
        cout << (solve(N) ? "Yes" : "No") << endl;
    }
}