#include <cmath>
#include <iostream>
using namespace std;
long long power(long long a, int b) {
	long long ret = 1;
	while (b) {
		if (b & 1) ret *= a;
		a *= a;
		b >>= 1;
	}
	return ret;
}
long long root(long long a, int b) {
	// return maximum x that x^b ≤ a (assume a ≤ 10^18)
	if (b == 1) return a;
	int l = 0, r = (int)(exp((log(10) * 18 + log(3)) / b));
	while (r - l > 1) {
		int m = (l + r) >> 1;
		if (power(m, b) > a) r = m;
		else l = m;
	}
	return l;
}
long long modmul(long long a, long long b, long long m) {
	long long ret = 0; a %= m; b %= m;
	while (a) {
		if (a & 1) {
			ret += b;
			if (ret >= m) ret -= m;
		}
		b += b;
		if (b >= m) b -= m;
		a >>= 1;
	}
	return ret;
}
long long modpowl(long long a, long long b, long long m) {
	long long ret = 1;
	while (b) {
		if (b & 1) ret = modmul(ret, a, m);
		a = modmul(a, a, m);
		b >>= 1;
	}
	return ret;
}
bool issprp(long long x, int a) {
	int s = 0; long long d = x - 1;
	while (!(d & 1)) d >>= 1, s++;
	long long z = modpowl(a, d, x);
	if (z == 1) return true;
	for (int i = 0; i < s; i++) {
		if (z == x - 1) return true;
		z = modmul(z, z, x);
	}
	return false;
}
bool isprime(long long x) {
	if (x == 2) return true;
	if (x <= 1 || x % 2 == 0) return false;
	int a[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23 };
	for (int i = 0; i < 9; i++) {
		if (x == a[i]) return true;
		if (!issprp(x, a[i])) return false;
	}
	return true;
}
bool isprimepower(long long x) {
	long long mul = 3;
	for (int i = 1; mul <= x; i++) {
		long long r = root(x, i);
		if (power(r, i) == x && isprime(r)) return true;
		mul *= 3;
	}
	return false;
}
bool solve(long long x) {
	if (x == 2) return false;
	if (x % 2 == 0) return true;
	for (long long b = 2; b < x; b *= 2) {
		if (isprimepower(x - b)) return true;
	}
	return false;
}
int main() {
	int Q;
	cin >> Q;
	while (Q--) {
		long long N;
		cin >> N;
		cout << (solve(N) ? "Yes" : "No") << endl;
	}
	return 0;
}