#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using u64 = unsigned long long;

namespace PR{
    ll fac[1000000], cnt;
    
    ll times(const ll &a, const ll &b, const ll &p) {
        ll res = a * b - (ll)((long double)a / p * b + 0.5) * p;
        return res < 0 ? res + p : res;
    }
    
    ll power(ll a, ll n, ll p) {
        ll ans = 1;
        a %= p;
        while (n) {
            if (n & 1) ans = times(ans, a, p);
            a = times(a, a, p); n >>= 1;
        }
        return ans;
    }
    
    ll gcd(ll a, ll b) {
        while (b) {
            ll t = b;
            b = a % b;
            a = t;
        }
        return a;
    }
    
    bool check(const ll &x) {
        if (x < 2) return false;
        for (int i = 2; i * i <= x; i ++)
            if (x % i == 0) return false;
        return true;
    }
    
    bool miller_rabin(const ll &n) {
        if (n < 100) return check(n);
        if ((~ n & 1) || n % 3 == 0 || n % 5 == 0 || n % 7 == 0 || n % 11 == 0 || n % 13 == 0 || n % 17 == 0 || n % 19 == 0 || n % 23 == 0 || n % 29 == 0) return false;
        ll b = __builtin_ctzll(n - 1), x = (n - 1) >> b;
        static int prime[12] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
        for (int i = 0; i < 12; i ++) {
            ll cur = power(prime[i], x, n), nxt;
            for (int j = 1; j <= b && cur != 1; j ++) {
                nxt = times(cur, cur, n);
                if (nxt == 1 && cur != n - 1) {
                    return false;
                }
                cur = nxt;
            }
            if (cur != 1) {
                return false;
            }
        }
        return true;
    }
    
    ll add(const ll &a, const ll &b, const ll &p) {
        u64 t = (u64)a + (u64)b;
        t -= t < (u64)p ? 0 : p;
        return t;
    }
    
    ll pollard_rho(const ll &n) {
        ll c = (rand() << 15 | rand()) % n + 1, a1 = 0, a2;
        a1 = add(times(a1, a1, n), c, n);
        a2 = add(times(a1, a1, n), c, n);
        while (a1 != a2) {
            ll d = gcd(abs(a1 - a2), n);
            if (d > 1) return d;
            a1 = add(times(a1, a1, n), c, n);
            a2 = add(times(a2, a2, n), c, n);
            a2 = add(times(a2, a2, n), c, n);
        }
        return n;
    }
    
    void Do(ll n) {
        if (n < 2) return ;
        if (miller_rabin(n)) {
            fac[++ cnt] = n;
            return ;
        }
        ll s = sqrt(n);
        if (s * s == n) {
            Do(s); Do(s); return ;
        }
        s = pollard_rho(n);
        while (s == 1 || s == n) s = pollard_rho(n);
        Do(s); Do(n / s);
    }
    
    void solve(const ll &n) {
        cnt = 0;
        Do(n);
        sort(fac + 1, fac + cnt + 1);
        for (int i = 1; i < cnt; i ++) {
            if (fac[i] == fac[i + 1]) {
                cout << "yes\n";
                return ;
            }
        }
        cout << "no\n";
    }
}

int main() {
    srand(time(0));
    
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    int T;
    cin >> T;
    while (T --) {
        ll n;
        cin >> n;
        PR::solve(n);
    }
    
    return 0;
}