#include <bits/stdc++.h>
using namespace std;

using ll = long long int;

ll D[2000009], pow2[60];

int main(){
	cin.tie(NULL);
	ios_base::sync_with_stdio(0);
	
	int T; cin >> T;
	pow2[0] = 1;
	for(int i = 1; i <= 50; ++i) {
		pow2[i] = pow2[i-1]*2;
	}
	while(T--) {
		ll n; cin >> n;
		int log = 0;
		while(n % pow2[log+1] == 0) {
			log++;
		}
		ll m = n/pow2[log];
		ll r = 2*pow2[log]-1;
		bool ok = true;
		int k = 0;
		for(ll d = 1; d*d <= m; ++d) {
			if(m % d == 0) {
				if(d != 1) {
					for(int i = 0; i <= log; ++i) {
						D[++k] = d*pow2[i];
					}
				}
				ll x = m/d;
				if(x != 1 && d*d != m) {
					for(int i = 0; i <= log; ++i) {
						D[++k] = x*pow2[i];
					}
				}
			}
		}
		sort(D+1, D+k+1);
		for(int i = 1; i <= k; ++i) {
			if(D[i] > r+1) {
				ok = false;
				break;
			}
			else {
				r += D[i];
			}
		}
		if(r < n-1) {
			ok = false;
		}
		cout << (ok ? "Yes\n" : "No\n");
	}

	return 0;
}