#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<assert.h>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define ll long long
#define ull unsigned ll


/* START: hash functions */

#define ULL_HASH_SIZE 10000
ull ull_hash_n[ULL_HASH_SIZE]; int ull_hash_d[ULL_HASH_SIZE];

void ullHashClear(void){ memset(ull_hash_d,0,ULL_HASH_SIZE*sizeof(int)); }
int ullHashFunction(ull a){ return (a*1007)%ULL_HASH_SIZE; }

int ullHashGet(ull a){
  int i=ullHashFunction(a);
  for(;;){
    if(ull_hash_n[i]==a && ull_hash_d[i]) break;
    if(!ull_hash_d[i]) break;
    i++; if(i==ULL_HASH_SIZE) i=0;
  }
  if(ull_hash_n[i]!=a) return 0; return ull_hash_d[i];
}

void ullHashSet(ull a,int n){
  int i=ullHashFunction(a);
  for(;;){
    if(ull_hash_n[i]==a && ull_hash_d[i]) break;
    if(!ull_hash_d[i]) break;
    i++; if(i==ULL_HASH_SIZE) i=0;
  }
  ull_hash_n[i]=a; ull_hash_d[i]=n;
}

int ullHashIncrease(ull a){
  int i=ullHashFunction(a);
  for(;;){
    if(ull_hash_n[i]==a && ull_hash_d[i]) break;
    if(!ull_hash_d[i]) break;
    i++; if(i==ULL_HASH_SIZE) i=0;
  }
  ull_hash_n[i]=a; return ++ull_hash_d[i];
}

/* END: hash functions */


int main(){
  int T;
  int i, j, n;
  char in[1200];
  int num[1200], sz;
  int mul[1200], szm;
  ull hs;

  /* calculate all Asmany number <= 10^1000, and store their hash values */
  num[0] = 2; sz = 1;
  for(n=2;sz<=1000;n++){
    hs = 0;
    rep(i,sz) hs = hs*1007 + num[sz-1-i];
    ullHashIncrease(hs);

    rep(i,sz) mul[i] = num[i]*2;
    szm = sz;
    rep(i,szm-1) if(mul[i]>=10) mul[i]-=10, mul[i+1]++;
    if(mul[szm-1]>=10){ mul[szm-1]-=10; mul[szm] = 1; szm++; }

    hs = 0;
    rep(i,szm) hs = hs*1007 + mul[szm-1-i];
    ullHashIncrease(hs);

    rep(i,sz) num[i] *= (4*n-2);
    for(i=sz-1;i>=0;i--){
      if(i) num[i-1] += (num[i]%n) * 10;
      num[i] /= n;
    }

    rep(i,sz-1){
      num[i+1] += num[i]/10;
      num[i] %= 10;
    }
    while(num[sz-1] >= 10){
      num[sz] = num[sz-1] / 10;
      num[sz-1] %= 10;
      sz++;
    }
  }
  
  assert( scanf("%d",&T)==1 );
  assert( 1<=T && T<=100 );
  while(T--){
    assert( scanf("%s",in)==1 );
    n = strlen(in);
    assert( 1<=n && n<=1000 && in[0]!='0' );
    rep(i,n) assert( '0'<=in[i] && in[i]<='9' );

    hs = 0;
    rep(i,n) hs = hs * 1007 + (in[i] - '0');
    if(ullHashGet(hs)) puts("YES"); else puts("NO");
  }
  
  return 0;
}

/* brute force for small L

int main(){
  int i, j, k, a, b;
  char in[1200];

  long long chk[100] = {};

  rep(i,25){
    rep(j,1<<i){
      rep(k,i) if(j&1<<k) in[k] = 1; else in[k] = 0;
      a = b = 0;
      REP(k,1,i) if(in[k]==0 && in[k-1]==0) a++;
      REP(k,1,i) if(in[k]==1 && in[k-1]==1) b++;
      if(a==b) chk[i]++;
    }
    printf("%d %lld\n",i,chk[i]);
  }

  return 0;
}
*/