#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for (ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(),v.end()
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n=1e5+1;
    vector<ll> p(n,1);
    for(ll i=2;i<n;i++){
        if(!p[i]) continue;
        for(ll j=i+i;j<n;j+=i) p[j]=0;
    }
    vector<ll> v;
    for(ll i=2;i<n;i++){
        if(p[i]) v.push_back(i);
    }
    ll q;
    cin >> q;
    while(q--){
        ll a;
        cin >> a;
        ll x=a;
        vector<ll> now;
        ll cnt=0;
        for(auto i:v){
            while(x%i==0){
                cnt++;
                now.push_back(i);
                if(3<cnt) break;
                x/=i;
            }
            if(3<cnt) break;
        }
        bool yn=false;
        if(cnt==2){
            a/=now[0];
            a/=now[1];
            bool ok=true;
            for(ll i=2;i*i<=a;i++){
                if(a%i==0){
                    ok=false;
                    break;
                }
            }
            if(a!=1&&ok) yn=true;
        }
        if(cnt==3){
            if(now[0]*now[1]*now[2]==a) yn=true;
        }
        if(yn) cout << "Yes\n";
        else cout << "No\n";
    }
}