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.
a=int(input())
list1=input().split()

list2=[]
for x in list1:
    x=int(x)
    if (x**(1/2))%1==0:
        y=int(x**(1/2))
        list2.append(y)
    else:
        list2.append(0.1)

n=max(list2)
s=[True for i in range(n)]
prime=[]
for i in range(2,n):
    if s[i]:
        prime.append(i)
        for j in range(i*2,n,i):
            s[j]=False
            
for n in list2:
    if n==1:
        print("NO")
    elif n==0.1:
        print("NO")
    elif n==2:
        print("YES")
    else:
        if n in prime:
            print("YES")
        else:
            print("NO")