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

# 预处理数组
N = int(1e6+1)
is_prime = [True] * N
is_prime[0], is_prime[1] = False, False
for i in range(2, int(math.sqrt(N))+1):
    if is_prime[i]:
        for j in range(i*i, N, i):
            is_prime[j] = False

def is_t_prime(num):
    # 判断一个数是否为T-prime
    # T-prime的特点是有且仅有三个正因子，即平方根也是质数
    if num == 1:
        return False
    sqrt_num = int(math.sqrt(num))
    if sqrt_num * sqrt_num == num and is_prime[sqrt_num]:
        return True
    return False

# 读取输入
n = int(input())
numbers = list(map(int, input().split()))

# 判断每个数是否为T-prime并输出结果
for num in numbers:
    if is_t_prime(num):
        print("YES")
    else:
        print("NO")