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

int main() {
    int Q;
    cin >> Q;

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

    while (Q--) [&] {
        ll A;
        cin >> A;

        for (int i = 0; i < (int)primes.size(); i++) {
            ll x = primes[i];

            if (x * x * x > A) {
                break;
            }

            if (A % x == 0) {
                for (int j = i; j < (int)primes.size(); j++) {
                    ll y = primes[j];
                    if (A % (x * y) == 0) {
                        ll z = A / (x * y);

                        for (int k = 0; k < (int)primes.size(); k++) {
                            if (primes[k] != z && z % primes[k] == 0) {
                                cout << "No\n";
                                return;
                            }
                        }

                        cout << "Yes" << endl;
                        return;
                    }
                }
            }
        }

        cout << "No\n";
    }();
}