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_t_prime(x):
    if x < 4:
        return False
    sqrt_x = int(math.sqrt(x))
    return sqrt_x * sqrt_x == x

# Input
n = int(input())
numbers = list(map(int, input().split()))

# Find prime numbers up to the maximum number in the input
max_num = max(numbers)
is_prime = [True] * (max_num + 1)
is_prime[0] = is_prime[1] = False

p = 2
while p * p <= max_num:
    if is_prime[p]:
        for i in range(p * p, max_num + 1, p):
            is_prime[i] = False
    p += 1

# Check if each number is T-prime
for num in numbers:
    if is_t_prime(num) and is_prime[int(math.sqrt(num))]:
        print("YES")
    else:
        print("NO")
