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.
# 只需要找质数，在判断它的平方
numlist = 1000001 * [True]
# True代表质数
numlist[0] = False
numlist[1] = False
for i in range(2, len(numlist)):
    if numlist[i]:
        times = 2
        while i * times <= 100000:
            numlist[i * times] = False
            times += 1
length = int(input())
test = list(map(int, input().split()))
for n in test:
    root = n**0.5
    if int(root) == root:
        if numlist[int(root)]:
            print("YES")
        else:
            print("NO")
        continue
    print("NO")
