#include <bits/stdc++.h>

#include <atcoder/all>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define FAST_IO                \
  ios::sync_with_stdio(false); \
  cin.tie(0);
const i64 INF = 1001001001001001001;
using Modint = atcoder::static_modint<998244353>;

vector<i64> erathosthenes(i64 N) {
  vector<i64> is_prime(N + 1, 1);
  is_prime[0] = is_prime[1] = 0;

  vector<i64> ret;
  for (i64 i = 2; i <= N; i++) {
    if (!is_prime[i]) continue;
    ret.push_back(i);
    for (i64 j = i; j <= N; j += i) {
      is_prime[j] = 0;
    }
  }
  return ret;
}

bool check(i64 A, vector<i64> & primes) {
  int cnt = 0;
  for (i64 p : primes) {
    while (A % p == 0) {
      A /= p;
      cnt++;
      if (A == 1) break;
      if (cnt == 3) return false;
    }
  }
  if (A > 1) cnt++;
  return cnt == 3;
}

int main() {
  FAST_IO
  auto ans = 0LL;

  vector<i64> primes = erathosthenes(100010);

  int Q;
  cin >> Q;
  for (int i = 0; i < Q; i ++) {
    i64 A;
    cin >> A;
    auto ret = check(A, primes);
    if (ret) {
      cout << "Yes" << endl;
    } else {
      cout << "No" << endl;
    }
  }

}