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
n = int(input())
m = list(map(int, input().split()))
N = int(1000001)
a = [True] * N
a[0], a[1] = False, False
for i in range(2, int(math.sqrt(N))+1):
    if a[i]:
        for j in range(i*i, N, i):
            a[j] = False

def t_prime(num):
    if num == 1:
        return False
    k = int(math.sqrt(num))
    if k * k == num and a[k]:
        return True
    else:
        return False

for num in m:
    if t_prime(num):
        print("YES")
    else:
        print("NO")