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 sieve(n) :
    primes = [True] *(n+1)
    primes[0],primes[1] = False,False
    for i in range(2,int(math.sqrt(n))+1):
        if primes[i]:
            for j in range(i*i, n+1, i):
                primes[j] = False
    return primes
def is_prime(n):
    if n<= 1:
        return False
    primes = sieve(n)
    return primes[n]
n = int(input())
line = list(map(int,input().split()))
for i in line:
    if round(math.sqrt(i))**2 == i:
        check = round(math.sqrt(i))
        prime = is_prime(check)
        if prime:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')