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())
arr = [int(x) for x in input().split()]
k = 1000001
ar = [0] * k
ar[0] = ar[1] = 1
for i in range(2,int(math.sqrt(k)+1)):
    if ar[i] == 0:
        j = i
        while(i * j < k):
            ar[i*j] = 1
            j += 1

print(ar[:11])
for i in arr:
    i = int(math.sqrt(i))
    if ar[i] == 0:
        print("YES")
    else:
        print("NO")