#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define rep2(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
template<typename... Args>
void bubu(Args... args) { cout << ":: "; ((cout << args << " "), ...); cout << endl; }
template<typename T>
void bubu(vector<T> tem) { for (auto x : tem) cout << x << ' '; cout << endl; }
void kuaidu() { ios::sync_with_stdio(false), cin.tie(0), cout.tie(0); }
inline int max(int a, int b) { if (a < b) return b; return a; }
inline int min(int a, int b) { if (a < b) return a; return b; }
using PII = pair<int, int>;
using i128 = __int128;
struct FENJIE {
    int gcd(int a, int b) {
        if (b == 0) return a;
        return gcd(b, a % b);
    }
    int mul(int a, int b, int m) {
        return static_cast<__int128>(a) * b % m;
    }
    int power(int a, int b, int m) {
        int res = 1 % m;
        for (; b; b >>= 1, a = mul(a, a, m))
            if (b & 1) res = mul(res, a, m);
        return res;
    }
    //判断一个数是不是质数
    bool isprime(int n) {
        if (n < 2) return false;
        static constexpr int A[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23 };
        int s = __builtin_ctzll(n - 1);
        int d = (n - 1) >> s;
        for (auto a : A) {
            if (a == n) return true;
            int x = power(a, d, n);
            if (x == 1 || x == n - 1) continue;
            bool ok = false;
            for (int i = 0; i < s - 1; ++i) {
                x = mul(x, x, n);
                if (x == n - 1) { ok = true; break; }
            }
            if (!ok) return false;
        }
        return true;
    }
    //求出一个数所有的质因数
    std::vector<int> factorize(int n) {
        std::vector<int> p;
        std::function<void(int)> f = [&](int n) {
            if (n <= 10000) {
                for (int i = 2; i * i <= n; ++i)
                    for (; n % i == 0; n /= i)
                        p.push_back(i);
                if (n > 1)
                    p.push_back(n);
                return;
            }
            if (isprime(n)) {
                p.push_back(n);
                return;
            }
            auto g = [&](int x) {
                return (mul(x, x, n) + 1) % n;
                };
            int x0 = 2;
            while (true) {
                int x = x0, y = x0, d = 1, power = 1, lam = 0, v = 1;
                while (d == 1) {
                    y = g(y);
                    ++lam;
                    v = mul(v, std::abs(x - y), n);
                    if (lam % 127 == 0) {
                        d = gcd(v, n); v = 1;
                    }
                    if (power == lam) {
                        x = y; power *= 2; lam = 0;
                        d = gcd(v, n); v = 1;
                    }
                }
                if (d != n) { f(d); f(n / d); return; }
                ++x0;
            }
            };
        f(n);
        std::sort(p.begin(), p.end());
        return p;
    }
    vector<int> ddd(vector<PII> tem) {
        std::vector<int> p;
        int l = 1;
        std::function<void(int)> f = [&](int n) {
            if (n == tem.size()) {
                p.push_back(l);
                return;
            }
            if (tem[n].second) {
                tem[n].second -= 1;
                l *= tem[n].first;
                f(n);
                l /= tem[n].first;
                tem[n].second += 1;
            }
            f(n + 1);
            };
        f(0);
        std::sort(p.begin(), p.end());
        return p;
    }
    //求出一个数的质因数，PII形式，代表质因数和指数
    vector<PII> zhiyinshu(int n) {
        vector<int> tem = factorize(n); vector<PII> tmp;
        tem.push_back(-1); int las = 0, cnt = 0;
        for (auto x : tem) {
            if (x != las) {
                if (las)tmp.push_back({ las,cnt });
                cnt = 1, las = x;
            }
            else cnt++;
        }
        return tmp;
    }
    //求出一个数的所有的因数
    vector<int> factor(int n) { return ddd(zhiyinshu(n)); }
}fj;
//--------------------------------------------------------------------------------
const int N = 1e5 + 10;
const int M = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e16;
int n, m, T;
set<int> S;

//--------------------------------------------------------------------------------

int dfs(int a, int b) {
    if (a <= 0 || b <= 0) return 0;
    set<int> s = S;
    vector<PII> q1 = fj.zhiyinshu(a), q2 = fj.zhiyinshu(b);
    for (auto [x, a] : q1) s.insert(x);
    for (auto [x, a] : q2) s.insert(x);
    int ans = 1;
    for (auto x : s) {
        if (ans * x >= n) return 0;
        ans *= x;
        if (ans >= INF) break;
    }
    if (ans < n) return 1;
    return 0;
}

signed main() {
    kuaidu();
    cin >> T;
    // cout << fj.isprime(343) << endl;
    while (T--) {
        cin >> n;
        if (n % 2 == 0) {
            vector<PII> tem2 = fj.zhiyinshu(n);
            int ans = 1;
            for (auto [x, a] : tem2) ans *= x;
            if (ans < n) { cout << "yes" << endl; }
            else cout << "no" << endl;
            continue;
        }
        int flag = 0;
        vector<PII> tem = fj.zhiyinshu(n);
        for (auto [x, a] : tem) {
            if (a > 1) flag = 1;
        }
        if (flag) {
            cout << "yes" << endl;
        }
        else cout << "no" << endl;
        continue;

    }

    return 0;
}