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=int(input())
Tp=[4]
T=[0]*317
for i in range(3,317):
    for j in range(2,int(i**0.5+1)):
        if T[j]==0 and i%j ==0:
            T[i]=1
    if T[i]==0:
        Tp.append(i**2)
li=[int(k) for k in input().split()]
for j in range(n):
    if li[j] in Tp:
        print("YES")
    else:
        print("NO")