We know that prime numbers are positive integers that have exactly two distinct positive divisors. Similarly, we'll call a positive integer *t* Т-prime, if *t* has exactly three distinct positive divisors.

You are given an array of *n* positive integers. For each of them determine whether it is Т-prime or not.
The first line contains a single positive integer, *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>), showing how many numbers are in the array. The next line contains *n* space-separated integers *x*<sub class="lower-index">*i*</sub> (1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">12</sup>).

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is advised to use the cin, cout streams or the %I64d specifier.
def sieve_of_eratosthenes(limit):
    prime = [True for _ in range(limit + 1)]
    p = 2
    while p * p <= limit:
        if prime[p]:
            for i in range(p * p, limit + 1, p):
                prime[i] = False
        p += 1
    primes = [p for p in range(2, limit + 1) if prime[p]]
    return set(primes) # 使用集合可以更快地进行查找操作

# 预计算所有10^6内的质数
primes = sieve_of_eratosthenes(int(1e6))

def is_t_prime(x):
    sqrt_x = int(x**.5)
    return x == sqrt_x * sqrt_x and sqrt_x in primes

n = int(input())
numbers = list(map(int, input().split()))
for x in numbers:
    print("YES" if is_t_prime(x) else "NO")
