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 is_prime(n):
    primes = [True] * (n+1)
    primes[0] = primes[1] = False
    
    x = 2
    while x * x <= n :
        if prime[x] :
            for i in range( x*x , n+1 , x):
                primes[i]=False
        x += 1
    return primes

n = int(input())
numbers = list(map(int,input().split()))

primes = is_prime(int(math.sqrt(max(numbers))+1))
for number in numbers :
    a = math.sqrt(number)
    m = int(a)
    if m * m != number :
        print("NO")
    else:
        if primes[m]:
            print("YES")
        else:
            print("NO")