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 generatePrimes(n):
    is_prime = [True] * (n+1)
    is_prime[0] = is_prime[1] = False
    primes = []

    for i in range(2, int(math.sqrt(n))+1):
        if is_prime[i]:
            for j in range(i*i, n+1, i):
                is_prime[j] = False

    for i in range(2, n+1):
        if is_prime[i]:
            primes.append(i)

    return primes

# 判断数字是否为T-Prime数
def isTPrime(x, primes):
    sqrt_x = int(math.sqrt(x))

    for i in range(2, sqrt_x+1):
        if x % i == 0 and primes[i]:
            return False

    return True

n = int(input())
array = list(map(int, input().split()))
max_num = max(array)

primes = generatePrimes(int(math.sqrt(max_num)))

for x in array:
    if isTPrime(x, primes):
        print("YES")
    else:
        print("NO")
