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.
#游敬恩，2300012555
import math

def dnum(x):
    dmax = math.ceil(math.sqrt(x))
    num = 0
    for i in range(1, dmax+1):
        if x%i == 0:
            num += 1
        else:
            pass
    if math.sqrt(x) == dmax:
        num = num * 2 - 1
    else:
        num *= 2
    return num

n = int(input())
d = dict(zip([i for i in range(n)], map(int, input().split())))
for i in range(n):
    num = dnum(d[i])
    if num == 3:
        print("YES")
    else:
        print("NO")