#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)< pii; typedef vector vi; typedef vector vll; 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 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; } 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<> Q; while (Q--) { ll N; cin >> N; cout << (solve(N) ? "Yes" : "No") << endl; } }