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.
from math import sqrt

def is_t_prime(x):
    if x < 4:
        return "NO"
    sqrt_x = int(sqrt(x))
    if sqrt_x * sqrt_x != x:
        return "NO"
    
    divisors = 2  
    for i in range(2, int(sqrt(sqrt_x)) + 1):
        if x % i == 0:
            divisors += 2  
    if sqrt(sqrt_x) == int(sqrt(sqrt_x)):
        divisors -= 1 
    
    return "YES" if divisors == 3 else "NO"

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

for x in numbers:
    print(is_t_prime(x))
