#include <iostream>
#include <vector>
#include <cmath>

using namespace std;
typedef long long ll;
typedef string str;

vector<ll> calc_primes(const ll max_num) {
  if(max_num < 2) return {};
  vector<ll> data = {2};
  for(ll num = 3; num <= max_num; num += 2){
    for(ll p : data){
      if(num % p == 0) break;
      else if (p * p > num){
        data.push_back(num);
        break;
      }
    }
  }
  return data;
}

int main() {
  ll Q;
  cin >> Q;

  vector<ll> A(Q);
  for(ll i=0; i<Q; i++){
    cin >> A[i];
  }
  const ll N_MAX = 10000000000;
  vector<ll> primes = calc_primes(pow(N_MAX, 0.5));

  ll counter = 0;
  ll num;
  
  for(ll j=0; j<Q; j++){
    counter = 0;
    num = A[j];
    
    for(ll i=0; i < primes.size(); i++){
      while(num % primes[i] == 0){
        num /= primes[i];
        counter++;
        if(counter > 3)
          goto label_break;
      }
    }
    if(num != 1)
      counter++;

    label_break:
    if(counter == 3)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
  
  return 0;
}