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.
import math
def ispr(n):
    s=math.floor(math.sqrt(n))
    flag=True
    for i in range(2,s+1):
        if n%i==0:
            flag=False
    if n==2:
        flag=True
    return flag

def ispi(n):
    s=math.sqrt(n)
    o=math.floor(s)
    if s==o and n!=1:
        return True
    else:
        return False

n=int(input())
ans=[]
m=list(map(int,input().split()))
for i in m:
    if ispi(i) and ispr(math.sqrt(i)):
        ans.append("YES\n")
    else:
        ans.append("NO\n")
for i in ans:
    print(i)