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 sushu(n):
    is_prime=[True]*(n+1)
    is_prime[0]=False
    is_prime[1]=False
    p=2
    while p*p<n:
        if is_prime[p]==True:
            for i in range(p*p,n,p):
                is_prime[i]=False
        p+=1
    primes=[i for i in range(n+1) if is_prime[i]]
    return(primes)
n=int(input())
nums1=list(map(int,input().split()))
for num in nums1:
    if num**0.5 %1 !=0:
        print('NO')
    else:
        k=int(num**0.5)
        if k in sushu(n):
            print('YES')
        else:
            print('NO')