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.
# 李城岳 生命科学学院 2300012106
import math
zhishu = [2]
num = int(math.sqrt(100000)//1 + 1)
for i in range(3, num):
    jud = 0
    for e in range(2, i):
        if i % e == 0:
            jud = 1
    if jud == 0:
        zhishu.append(i)
tshu = []
for i in zhishu:
    tshu.append(i**2)
no = input()
nums = list(map(int, input().split()))
for i in nums:
    if i in tshu:
        print('YES')
    else:
        print('NO')