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

sqrt_lim = 1000001

def prime_squares():
    arr = [True] * sqrt_lim 
    p = 2

    while p * p <= sqrt_lim:
        if arr[p]:
            for i in range(p*p, sqrt_lim, p):
                arr[i] = False
        p += 1
    primes = []
    for p in range(2, sqrt_lim):
        if arr[p]:
            primes.append(p)
    return primes
primes = prime_squares()

def is_t_prime(num):
    sqrt_num = int(math.sqrt(num))
    return 'YES' if sqrt_num in primes and sqrt_num ** 2 == num else 'NO'

n = int(input())
lst = list(map(int, input().split()))
for elem in lst:
    print(is_t_prime(elem))