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 sieve_of_eratosthenes(n):
    primes = [True] * (n + 1)
    primes[0] = primes[1] = False

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

    return [i for i in range(n + 1) if primes[i]]


def is_t_prime(num, primes):
    if num == 1:
        return False
    if math.isqrt(num) ** 2 != num:
        return False
    if math.isqrt(num) in primes:
        return True

    return False


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

# Generate a list of prime numbers
primes = set(sieve_of_eratosthenes(int(math.sqrt(max(numbers)))))

for num in numbers:
    if is_t_prime(num, primes):
        print("YES")
    else:
        print("NO")
