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
def euler_sieve(x):
    is_Prime=[True]*x
    Prime=[]
    for i in range(2,x+1,1):
        if is_Prime[i-1]:
            Prime.append(i)
            n=2
            while n*i<=x:
                is_Prime[i*n-1]=False
                n+=1
        else:
            continue
    return Prime

n=int(input())
numbers=list(map(int,input().split()))
for i in numbers:
    if i==1:
        print('NO')
    else:
        maximum=math.ceil(math.sqrt(i))
        primes=prime(maximum)
        if primes[-1]**2==i:
            print('YES')
        else:
            print('NO')