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.
M=100000
Num = [True]*M
Num[0]=False
b = 1
while b<M:
    if Num[b]==False:
        b+=1
        continue
    cnt = 2
    while cnt*(b+1)<=M:
        Num[cnt*(b+1)-1]=False
        cnt+=1
    b+=1
su = [i+1 for i in range(M) if Num[i]]
n = int(input())
shu = [float(x)**0.5 for x in input().split()]

for i in range(n):
    if shu[i]== int(shu[i]) and shu[i] in su:
        print("YES")
    else:
        print("NO")