#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    const int MX = 100000;
    vector<bool> is_prime(MX + 1, true);
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i * i <= MX; ++i) {
        if (is_prime[i]) {
            for (int j = i * i; j <= MX; j += i) {
                is_prime[j] = false;
            }
        }
    }
    vector<int> primes;
    for (int i = 2; i <= MX; ++i) {
        if (is_prime[i]) primes.push_back(i);
    }

    int Q;
    cin >> Q;

    while (Q--) {
        ll N;
        cin >> N;

        int cnt = 0;
        for (ll x : primes) {
            while (N % x == 0) {
                N /= x;
                cnt++;
            }

            if (cnt > 3) break;
            if (N == 1) break;
        }

        cout << ((cnt == 3 && N == 1) || (cnt == 2 && N > 1) ? "Yes" : "No") << '\n';
    }
}