#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ll, ll> PLL;
#define endl '\n'
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
const int N=1e6+10;
#define debug(x) cout<<#x<<": "<<x<<endl

ll qmul(ll a, ll b, ll p) {return (a * b - (ll)((ld)a/p*b)*p+p)%p;}

ll qpow(ll x, ll k, ll p)
{
    x %= p;
    ll res = 1;
    while(k)
    {
        if(k & 1) res = qmul(res, x, p);
        x = qmul(x, x, p), k >>= 1;
    }
    return res;
}

const int pcnt = 12;
const ll p0[pcnt + 1] = {0, 2, 3, 5, 7, 11, 13, 17, 19, 61, 2333, 4567, 24251};
ll max_factor;

bool miller_rabin(ll x, ll p)
{
    if(qpow(x, p - 1, p) != 1) return 0;
    ll k = p - 1;
    while(!(k&1))
    {
        k>>=1;
        ll t = qpow(x, k, p);
        if(t != 1 && t != p - 1)
        {
            return 0;
        }
        if(t == p - 1)
        {
            return 1;
        }
    }
    return 1;
}

bool test(ll p)
{
    if(p == 1) return 0;
    rep(i, 1, pcnt)
    {
        if(p == p0[i]) return 1;
    }
    rep(i, 1, pcnt)
    {
        if(!miller_rabin(p0[i], p))
        {
            return 0;
        }
    }
    return 1;
}

mt19937 rd(time(NULL));
ll F(ll x, ll b, ll p) {return (qmul(x, x, p) + x + b) % p;}

ll pollard_rho(ll x)
{
    if(x < 2) return -1;
    if(test(x)) return x;
    while(1)
    {
        ll t1 = rd() % (x - 1) + 1, b = rd() % (x - 1) + 1, t2 = F(t1, b, x);
        int lim = 1;
        while(t1 != t2)
        {
            ll cnt = 1;
            rep(i, 1, lim)
            {
                ll tmp = qmul(cnt, llabs(t1 - t2), x);
                if(!tmp) break;
                cnt = tmp;
                t1 = F(t1, b, x), t2 = F(F(t2, b, x), b, x);
            }
            ll t = __gcd(cnt, x);
            if(t != 1)
            {
                return max(pollard_rho(t), pollard_rho(x / t));
            }
            lim = min(lim<<1, 128);
        }
    }
}

vector<pll>get_prime_divisors(ll x)
{
    vector<pll> ans;
    ll now = pollard_rho(x), cnt = 0;
    while(now!=-1)
    {
        while(x % now == 0) cnt++, x /=now;
        ans.push_back({now, cnt});
        now = pollard_rho(x), cnt = 0;
    }
    return ans;
}

void solve()
{
    ll x;
    cin >> x;
    vector<pll> div = get_prime_divisors(x);
    for(auto [q, w] : div)
    {
        if(w >= 2)
        {
            cout << "yes" << endl;
            return;
        }
    }
    cout << "no" << endl;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    int T=1;
    cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}