#include <cmath>
#include <iostream>
#include <vector>


int main() {
    const int N = 1000000;
    std::vector<int>numbers(N+1);
    std::vector<int> primes;

    for (int i=2; i<=N; ++i) {
        if (numbers[i] == 0) {
            numbers[i] = i;
            primes.push_back(i);
        }
        for (int j=0; j<(int)primes.size() && primes[j]<=numbers[i] && i*primes[j]<=N; ++j)
            numbers[i * primes[j]] = primes[j];
    }
    int amount_numbers;
    std::cin >> amount_numbers;
    while (amount_numbers--) {
        int64_t current_number;
        std::cin >> current_number;
        auto sqrt = std::sqrt(current_number);
        auto sqrt_int = static_cast<int>(sqrt);
        if (sqrt == sqrt_int && numbers[sqrt_int] == sqrt_int) {
            std::cout << "YES";
        } else {
            std::cout << "NO";
        }
        std::cout << " ";
    }
}