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.
from math import sqrt
 
input()
list_of_numbers = tuple(map(int, input().split()))
for i in list_of_numbers:
    x = sqrt(i)
    if x in (2, 3):
        print("YES")
    elif x != int(x) or x == 1 or x % 2 == 0:
        print("NO")
    else:
        if not ((x + 1)/6 == int((x + 1)/6) or (x - 1)/6 == int((x - 1)//6)):
            print("NO")
        else:
            z = 'YES'
            for k in range(3, int(sqrt(x)) + 1, 2):
                if x % k == 0:
                    z = "NO"
                    break
                z = 'YES'
            print(z)