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(input())
list_1 = list(map(int, input().split()))
max_num = max(list_1)
prime_num = [True] * (max_num + 3)
for i in range(2, math.ceil(math.sqrt(max_num))):
    if prime_num[i]:
        for j in range(i ** 2, max_num, i):
            prime_num[j] = False
for i in list_1:
    if math.sqrt(i) == math.floor(math.sqrt(i)):
        if prime_num[int(math.sqrt(i))]:
            print('YES')
    else:
        print('NO')
