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):
    if n < 2:
        return False
    for i in range(2, int(math.sqrt(n)) + 1):
        if n % i == 0:
            return False
    return True

def checkTPrime(x):
    sqrt_x = math.sqrt(x)
    if sqrt_x % 1 != 0 or sqrt_x < 2:
        return "NO"
    if is_prime(int(sqrt_x)):
        return "YES"
    return "NO"

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

# 处理数组中的每个数字
for x in numbers:
    result = checkTPrime(x)
    print(result)
