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.
#先定义一个函数来判断数字是否为t_prime
def t_prime(a):
    c = 0
    for i in range(1,a+1):
        if a % i == 0:
            c += 1
    if c == 3:
        return True
    return False           

n = int(input())
out = [] #用于储存结果

for i in map(int,input().split()):
    if t_prime(i):
        out.append("YES")
    else:
        out.append("NO")

for i in range(n):
    print(out[i])