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 binaryfuck(n):
    op = False 
    l = 2 
    r = n-1 
    while l<=r :
        m = (l+r)//2
        if m*m == n :
            if isPrime(m):
                return 1 
            return 0 
        elif m*m < n :
            l = m+1 
        else :
            r = m-1

    return 0 

n = int(input())
l = list(map(int,input().split()))
for i in l :
    if binaryfuck(i):
        aa.append("YES")
    else :
        aa.append("NO")

for i in aa :
    print(i)