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
n = int(input())
x = list(map(int, input().split()))
N = max(x)

primes = [i for i in range(N + 1)]
primes[1] = 0
i = 2
while i <= N:
    if primes[i] != 0:
        j = i + i
        while j <= N:
            primes[j] = 0
            j = j + i
    i += 1
primes = [i for i in primes if i != 0]
for i in x:
    if sqrt(i) % 1 != 0:
        print('NO')
    else:
        if sqrt(i) in primes:
            print('YES')
