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

# Initialize a list of zeros representing prime numbers
a = [0] * 1000001

# Sieve of Eratosthenes to mark non-prime numbers
for i in range(2, 1000001):
    if a[i] == 0:
        for j in range(2, 1000001 // i + 1):
            a[i * j] = 1

n = int(input())

for _ in range(n):
    b = int(input())
    sq = int(math.sqrt(b))

    if b == 1:
        print("NO")
    elif sq * sq == b and a[sq] == 0:
        print("YES")
    else:
        print("NO")
