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.
from math import sqrt

primes,check=[],[True for _ in range(1000000)]
n=int(input())
lst=list(map(int,input().split()))
max_num=2
for i in lst:
    a=sqrt(i)
    if a==int(a) and a>max_num:
        for num in range(max_num,a+1):
            if check[num]:
                primes.append(num)
            for prime in primes:
                if prime*num>=(a+1):
                    break
                else:
                    check[prime*num]=False
                if num%prime==0:
                    break
        if a in primes:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')