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())
numbers=input().split()
for i in range(n):
    numbers[i]=int(numbers[i])

a=int(math.sqrt(max(numbers)))+1
x=2
lst=[j for j in range(a)]
sushu=[]
while x<(a//2):
    for k in range(x*2,a,x):
        lst[k]=0
    x+=1
for y in lst:
    if y>1:
        sushu.append(y)

for number in numbers:
    b=math.sqrt(number)
    if b!=math.floor(b):
        print('NO')
    else:
        if b in sushu:
            print('YES')
        else:
            print('NO')