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

# Function to generate a list of prime numbers
def sieve_of_eratosthenes(limit):
    sieve = [True] * (limit + 1)
    sieve[0] = sieve[1] = False
    primes = []
    for p in range(2, int(math.sqrt(limit)) + 1):
        if sieve[p]:
            primes.append(p)
            for i in range(p * p, limit + 1, p):
                sieve[i] = False
    return primes

# Function to determine if a number is Т-prime
def is_t_prime(x, primes):
    if x == 1:
        return False
    sqrt_x = int(math.sqrt(x))
    if sqrt_x * sqrt_x != x:
        return False
    if sqrt_x in primes:
        return True
    return False

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

# Generate a list of prime numbers up to the square root of the maximum possible value
primes = sieve_of_eratosthenes(int(math.sqrt(10**12)))

# Check if each number is Т-prime and print the result
for number in numbers:
    if is_t_prime(number, primes):
        print("YES")
    else:
        print("NO")
