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.
def prime(n):
    s=set()
    ans=0
    ans=[True]*(n+1)
    ans[0]=ans[1]=False
    for i in range(2,int(n**0.5)):
        if ans[i]:
            for j in range(i*i,n+1,i):
                ans[j]=False
    for k in range(2,n+1):
        if ans[k]:
            s.add(k)
    return s

n=int(input())
l=input().split()
l1=[]
for i in range(len(l)):
    l1.append(int(l[i]))
m=max(l1)
ans=prime(m)
for i in range(len(l)):
    sq=int(l[i])**0.5
    if sq==sq//1:
        if int(sq) in ans:
            print("YES")
        else:
            print("NO")
    else:
        print("NO")