#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

bool is_prime(long long n){
      if(n == 1) return false;
      for(long long i = 2; i * i <= n; i++){
         if(n % i == 0) return false;
      }
      return true;
   
}
int main(){
   vector<long long> ps;
   for(long long i=1;i<=100000;i++){
      if(is_prime(i)){
         ps.push_back(i);
      }
   }
   int t;
   cin>>t;
   rep(i,t){
      long long a;
      cin>>a;
      long long c = 0;
      rep(j,ps.size()){
         while(a%ps[j] ==0){
            c++;
            a /= ps[j];
         }
      }
      if(a!=1)c++;
      if(c==3){
         cout<<"Yes"<<endl;
      }
      else{
         cout<<"No"<<endl;
      }
   }
  
	return 0;
}