#include <iostream>
#include <algorithm>
#include <vector>
#include <functional>
using namespace std;

bool is_SPRP(uint64_t n, uint64_t a) {
  uint64_t s = __builtin_ctzll(n - 1), d = (n - 1) >> s, cur = 1;
  for (uint64_t pw = d; pw; pw >>= 1) {
    if (pw & 1) cur = ((__uint128_t)cur * a) % n;
    a = ((__uint128_t)a * a) % n;
  }
  if (cur == 1) return true;
  for (; s--; cur = ((__uint128_t)cur * cur) % n)
    if (cur == n - 1) return true;
  return false;
}

bool is_prime(uint64_t x) {
  if (x <= 1) return false;
  vector<uint64_t> bases{2, 325, 9375, 28178, 450775, 9780504, 1795265022};
  if (x < 1ull << 32) bases = {2, 7, 61};

  for (const uint64_t base : bases)
    if (x != base && !is_SPRP(x, base)) return false;
  return true;
}

long power(long base, int exponent){
    long ans = 1;
    for(int i = 0; i < exponent; i++){
        ans *= base;
        if(ans > 6e18 / base){
            return 2e18;
        }
    }
    return ans;
}

bool is_prime_exponentiation(long X){
    for(int i = 1; i < 100; i++){
        long left = 1, right = 2e18; // [left, right]
        while(left <= right){
            long middle = (left + right) / 2;
            long power_num = power(middle, i);
            if(power_num > X){
                right = middle - 1;    
            }else if(power_num < X){
                left = middle + 1;
            }else if(is_prime(middle)){
                return true;
            }else{
                break;
            }
        }
    }
    return false;
}

bool testcase(long N){
    if(N == 2){
        return false;
    }else if(N % 2 == 0){
        return true;
    }
    for(long i = 2; i < N; i *= 2){
        for(int j = 1; j < 100; j++){
            long left = 1, right = 2e18; // [left, right]
            while(left <= right){
                long middle = (left + right) / 2;
                long power_num = power(middle, j);
                if(power_num > N - i){
                    right = middle - 1;    
                }else if(power_num < N - i){
                    left = middle + 1;
                }else if(is_prime_exponentiation(middle)){
                    return true;
                }else{
                    break;
                }
            }
        }
    }
    return false;
}

int main(){
    int Q;
    cin >> Q;
    for(int i = 0; i < Q; i++){
        long N;
        cin >> N;
        if(testcase(N)){
            cout << "Yes" << endl;
        }else{
            cout << "No" << endl;
        }
    }
}