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 decimal

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

def primetest(p):
    if p == 2:
        return True
    if p < 2 or p % 2 == 0:
        return False
    for i in range(3, int(p**decimal.Decimal('0.5')) + 1, 2):
        if p % i == 0:
            return False
    return True

decimal.getcontext().prec = 100  # 设置精度，根据实际需求调整

for num in nums:
    if num == 1:
        print('NO')
        continue
    p = decimal.Decimal(num).sqrt()
    if p == int(p) and primetest(int(p)):
        print("YES")
    else:
        print("NO")