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 prime_number(x):
    number=[True]*(x+1)
    prime_number=[]
    for i in range(2,x+1):
        if number[i]:
            prime_number.append(i)
        for ii in range(len(prime_number)):
            if i*prime_number[ii]>x:
                break
            number[i*prime_number[ii]]=False
            if i%prime_number[ii]==0:
                break
    return prime_number
n=int(input())
number=input().split()
for iii in range(n):
    y=int(number[iii])**0.5
    if y==int(y) and y in prime_number(int(y)):
        print('YES')
    else:
        print('NO')
        