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 euler_sieve(n):
    sieve = [1]*(n-1)
    primes = []
    for j in range(2,n+1):
        if sieve[j-2]:
            primes.append(j)
        o = 0
        flag = 1
        while flag:
            if j * primes[o] <= n:
                sieve[j*primes[o]-2] = 0
            if j % primes[o] == 0:
                flag = 0
            o += 1
    return primes
n = int(input)
nums = list(map(int,input().split()))
l = euler_sieve(max(nums))
for i in range(n):
    if nums[i]**0.5 in l:
        print('YES')
    else:
        print('NO')