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

N = int(1e4)
isprime = [0] * (N + 1)  # Initialize isprime list with zeros
isprime[0] = isprime[1] = 1  # 0 and 1 are not prime

# Calculate prime numbers using the Sieve of Eratosthenes
for a in range(2, int(N**0.5) + 1):
    if isprime[a] == 0:  # If a is marked as prime
        for i in range(a * a, N + 1, a):
            isprime[i] = 1  # Mark all multiples of a as not prime

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

for i in range(n):
    if math.sqrt(nums[i]) % 1 == 0:  # Check if the square root is an integer
        if isprime[int(math.sqrt(nums[i]))] == 0:  # Check if the square root is prime
            print("NO")
        else:
            print("YES")
    else:
        print("NO")
