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
results = [True]*(N+1)
primes = []
results[0] = False
results[1] = False
for i in range(2,N):
    if results[i]:
        primes.append(i)
    for p in primes:
        if i * p > N:
            break
        results[i * p] = False
        if i % p == 0:
            break

n = int(input())
ls = list(map(int,input().split()))
for m in ls:
    k = int(m ** 0.5)
    if k ** 2 == m and results[k]:
        print("YES")
    else:
        print("NO")




