#include
#include <string.h>
#include
using namespace std;
#define N 100005
typedef long long LL;
bool vis[N];
int p[N], k=0;
void get_prime()
{
for(int i = 2; i )
{
if(!vis[i])
{
p[k++] = i;
for(int j = i + i; j i)
vis[j] = 1;
}
}
}
bool ok(LL n)
{
if(n == 1) return 1;
if(n&1) return 0;
LL al = 1;
for(int i = 0; i )
{
if(n % p[i] == 0)
{
if(p[i] > al + 1 && p[i] != 2) return 0;
LL s = 1;
LL tmp = 1;
while(n%p[i] == 0)
{
n /= p[i];
tmp *= p[i];
s += tmp;
}
al *= s;
}
}
if(n > al + 1) return 0;
return 1;
}
int main()
{
int t; LL n;
get_prime();
cin >> t;
while(t--)
{
cin >> n;
if(ok(n)) cout <<"Yes" << endl;
else cout <<"No" << endl;
}
return 0;
}