#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i=0; i<(int)n; i++)
using ll = long long int;

int prime_factorize(ll n, vector<pair<ll, int>> &p) {
  int ret = 0;
  for (ll i = 2; i * i <= n; i++) {
    int k = 0;
    while (n % i == 0) {
      k++;
      n /= i;
    }
    if (k > 0)
      ret += k;
    if (ret > 3) break;
  }
  if (n != 1)
    ret += 1;
  return ret;
}

int main() {
  int Q;
  cin >> Q;
  rep(i, Q) {
    ll Ai;
    cin >> Ai;
    vector<pair<ll, int>> p;
    if (prime_factorize(Ai, p) == 3)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  return 0;
}