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 olasieve(n):
    ans=[False]*(n+2)
    for i in range(2,n+1):
        if not ans[i]:
            for j in range(i,n//i+1):
                ans[i*j]=True
    if ans[n]==False:
        return True



n=int(input())
arr=list(map(int,input().split()))
ans=[]
for i in arr:
    if int(i**0.5)**2==i:
        a=int(i**0.5)
        if olasieve(a)==True:
            ans.append('YES')
        else:
            ans.append('NO')
    else:
        ans.append('NO')
        
for an in ans:
    print(an)