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=list(map(int,input().split()))
Numbers=[]
for number in numbers:
    a=math.sqrt(number)
    if a==math.floor(a):
        Numbers.append(number)

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

for num in numbers:
    if num in Numbers:
        print('YES')
    else:
        print('NO')