#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define lint long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define SZ(v) ((int)v.size())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1LL<<(n))
#define POPCNT(n) (__builtin_popcount(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); }
template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); }
template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); }
template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); }
template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; }
template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e,v); }
const lint MOD = 1000000007;
const lint INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;

// ミラーラビン素数判定法
struct MillerRabin {
    mt19937_64 mt;

    MillerRabin()
    {
        mt.seed(chrono::steady_clock::now().time_since_epoch().count());
    }

    // a^n (mod m)
    int mod_pow(__int128_t a, int n, int m)
    {
        a %= m;
        if (a < 0) a += m;
        __int128_t res = !!a;
        while (n > 0) {
            if (n & 1) res = res * a % m;
            a = a * a % m;
            n >>= 1;
        }
        return res;
    }

    // 素数判定
    bool is_prime(int n, int k = 50)
    {
        if (n == 2) return true;
        if (n < 2 || !(n & 1)) return false;

        int d = n - 1;
        while (!(d & 1)) {
            d >>= 1;
        }

        uniform_int_distribution<int> dist(1, n - 1);
        for (int i = 0; i < k; ++i) {
            int a = dist(mt);
            int t = d;
            int y = mod_pow(a, t, n);
            while (t != n - 1 && y != 1 && y != n - 1) {
                y = mod_pow(y, 2, n);
                t <<= 1;
            }
            if (y != n - 1 && !(t & 1))
                return false;
        }
        return true;
    }
};

const int MAXN = 1000000;
bool is_prime[MAXN];  // iが素数かどうか
vector<int> prime;

void sieve(int n = MAXN) {
    fill(is_prime + 2,is_prime + n, true);
    for (int i = 2; i < n; i++) {
        if (is_prime[i]) {
            prime.push_back(i);
            for (int j = i * i; j < n; j += i) {
                is_prime[j] = false;
            }
        }
    }
}

void _main() {
    sieve();
    int Q;
    cin >> Q;
    MillerRabin mr;
    REP(i, Q) {
        int N;
        cin >> N;
        if (N <= 2) {
            cout << "No" << endl;
        } else if (N % 2 == 0) {
            cout << "Yes" << endl;
        } else {
            bool no = true;
            for (int j = 2; j < N; j <<= 1) {
                int rem = N - j;
                if (mr.is_prime(N - j)) {
                    no = false;
                    break;
                }
                int rem_sqrt = (int)sqrt(N - j);
                if (rem_sqrt * rem_sqrt == rem) {
                    if (mr.is_prime(rem_sqrt)) {
                        no = false;
                        break;
                    }
                }
                FOR(k, 3, 60) {
                    int root = (int)(pow(rem, 1.0 / k) + EPS);
                    __int128_t tmp = 1;
                    REP(l, k) tmp *= root;
                    if (tmp == rem && is_prime[root]) {
                        no = false;
                        break;
                    }
                }
                if (!no) break;
            }
            cout << (no ? "No" : "Yes") << endl;
        }
    }
}

signed main(signed argc, char **argv) {
    if (argc > 1) {
        if (strchr(argv[1], 'i'))
            freopen("input.txt", "r", stdin);
        if (strchr(argv[1], 'o'))
            freopen("output.txt", "w", stdout);
    }
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    _main();
    return 0;
}