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 primesquare(n2):
    n=int(n2**0.5)
    sieve = [True] * (n + 1)
    sieve[0] = sieve[1] = False

    for i in range(2, int(n**0.5) + 1):
        if sieve[i]:
            for j in range(i*i, n+1, i):
                sieve[j] = False

    primesquare = set()
    for i in range(2, n+1):
        if sieve[i]:
            primesquare.add(i*i)

    return primesquare

n=int(input())
mapl=map(int,input().split())
l=[]
maxi=0
for i in mapl:
    l.append(i)
    if i > maxi:
        maxi=i
primesquare=primesquare(maxi)
for i in l:
    if i in primesquare:
        print('YES')
    else:
        print('NO')