#include <stdio.h>
#include <stdint.h>
#include <math.h>

typedef unsigned __int128 uint128_t;

uint64_t modpow64(uint64_t a, uint64_t n, uint64_t m){
  uint64_t r;
  for(r=1;n;n/=2){
    if(n&1) r = (uint128_t) r * a % m;
    a = (uint128_t) a * a % m;
  }
  return r;
}

int is_prime64(uint64_t n){
  int i, j, r;
  uint64_t d;
  static const uint64_t as[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
  if(n <= 1) return 0;
  if(n <= 3) return 1;
  if(!(n & 1)) return 0;
  r = __builtin_ctzll(n-1);
  d = (n-1) >> r;
  for(i=0;i<7;i++){
    uint64_t a = as[i];
    uint64_t t = modpow64(a, d, n);
    if(t == 0) return 1;
    if(t == 1) continue;
    for(j=0;t!=n-1;j++){
      if(j == r-1) return 0;
      t = (uint128_t) t * t % n;
      if(t == 1) return 0;
    }
  }
  return 1;
}

uint64_t gcd64(uint64_t x, uint64_t y){
  int bx = __builtin_ctzll(x);
  int by = __builtin_ctzll(y);
  int k = (bx < by) ? bx : by;
  x >>= bx;
  y >>= by;
  while(x!=y){
    if(x < y){
      y -= x;
      y >>= __builtin_ctzll(y);
    }
    else {
      x -= y;
      x >>= __builtin_ctzll(x);
    }
  }
  return x << k;
}


uint64_t is_primepower64(uint64_t n){
  uint64_t i;
  if(n <= 1) return 0;
  if(!(n&(n-1))) return 1;
  if(!(n&1)) return 0;

  for(i=2;i<=n;i++){
    uint64_t in = modpow64(i, n, n);
    uint64_t p = gcd64(in-i, n);
    if(p == 1) return 0;
    if(is_prime64(p)){
      while(n % p == 0) n /= p;
      if(n == 1) return p;
      else return 0;
    }
    n = p;
  }
  return -1;
}


int main(){
  int i, q;
  scanf("%d", &q);
  for(i=0;i<q;i++){
    uint64_t n;
    scanf("%ld", &n);
    if(n<=2) puts("No");
    else if((n&1)==0) puts("Yes");
    else {
      uint64_t j;
      for(j=2; j<n; j<<=1){
        if(is_primepower64(n-j)){
          break;
        }
      }
      if(j>=n) puts("No"); else puts("Yes");
    }
  }
  return 0;
}