#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using mint = atcoder::modint1000000007;

vector<ll> p;
void setup(){
	int n=1e5+1;
	vector<bool> is_prime(n,1);
	is_prime.at(0)=is_prime.at(1)=0;
	for(ll i=2;i<n;i++){
		if(is_prime.at(i)){
			p.push_back(i);
			for(ll j=i*i;j<n;j+=i){
				is_prime.at(j)=0;
			}
		}
	}
}

void solve(){
	ll a;
	cin>>a;
	int ct=0;
	for(ll x:p){
		if(x*x>a) break;
		while(a%x==0){
			a/=x;
			ct++;
		}
		if(ct>3){
			cout<<"No\n";
			return;
		}
	}
	if(a>1) ct++;
	if(ct==3) cout<<"Yes\n";
	else cout<<"No\n";
}

int main(){
	setup();
	int q;
	cin>>q;
	rep(i,q) solve();
}