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 check(m):
    if m == 1:
        return False
    flag = True
    temp = int(m ** 0.5)
    for i in range(2, temp):
        if m % i == 0:
            flag = False
            break
    return flag

n = int(input())
x = list(map(int, input().split()))
for i in range(n):
    sq = int(x[i] ** 0.5)
    if sq * sq != x[i]:
        print("NO")
    elif check(sq) == True:
        print("YES")
    else:
        print("NO")