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 sushu(n):
    numdict = {0:"NO",1:"NO"}
    numset = {2,3}
    i = 2
    while i <= n:
        if i in numdict.keys():
            i += 1
            continue
        numdict[i] = "YES"
        numset.add(i)
        for k in range(i**2,n+1,i):
            numdict[k] = "NO"
        i += 1
    return numdict,numset
n = int(input())
for i in range(n):
    num = int(input())
    if num ** 0.5 in sushu(num)[1]:
        print("YES")
    else:
        print("NO")

