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.
#The core problem is to collect prime number
N = int(input())
n= 10**6
list=[int(i) for i in input().split(" ")]
prime_list = [False] + [True]*(n-1)
for i in range(1,int((n)**(1/2))+2):
    if prime_list[i]:
        for k in range(1,int(n/(i+1))):
            prime_list[k*(i+1)+i] = False
for j in list:
    a = j**(1/2)
    if int(a) - a == 0:
        if prime_list[int(a)-1]:
            print("YES")
        else:
            print("NO")
    else:
        print("NO")
