#include <bits/stdc++.h>
using namespace std;

bool is_prime(long long n) {
    if (n == 1) {
        return false;
    }
    for (long long i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}

int main() {
    vector<bool> prime(100000, true);
    for (int i = 2; i < 100010; i++) {
        if (!prime[i]) {
            continue;
        }
        for (int j = i * 2; j < 100010; j += i) {
            prime[j] = false;
        }
    }
    vector<long long> p;
    for (int i = 2; i <= 10000; i++) {
        if (prime[i]) {
            p.push_back((long long)i);
        }
    }
    set<long long> s;
    for (auto x : p) {
        for (auto y : p) {
            s.insert(x * y);
        }
    }
    int q;
    cin >> q;
    while (q--) {
        long long a;
        cin >> a;
        bool ok = false;
        for (auto x : s) {
            if (a % x != 0) {
                continue;
            }
            long long b = a / x;
            if (is_prime(b)) {
                ok = true;
                break;
            }
        }
        cout << (ok ? "Yes" : "No") << endl;
    }
}