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.
N = 1000000

filt = [False for i in range(N+1)]
primes=[]
for num in range(2,N+1):
    if not filt[num]:
        primes.append(num)
    for prime in primes:
        if num*prime > N:
            break
        filt[num*prime] = True
        if num % prime == 0:
            break

primes = set(primes)

n = input()

for number in map(int,input().split()):
    squ = int(number**(1/2))
    if squ**2 == number and squ in primes:
        print('YES')
    else:
        print('NO')