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
input()
nums = [int(i) for i in input().split()]

max_num = int(sqrt(max(nums))) + 1
primes = {i: 1 for i in range(2, max_num)}
for i in range(2, max_num):
    for j in range(2, max_num // i + 1):
        if i * j <= max_num:
            primes[i * j] = 0

for i in nums:
    if sqrt(i) % 1 == 0 and i != 1:
        print(['NO', 'YES'][primes[int(sqrt(i))]])
    else:
        print('NO')