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.
s = []
for i in range(10**6):
    s.append(i)
for i in range(2, 10**6):
    if s[i] % i == 0 and s[i] != 0:
        j = 2 * i
        while j < 10 **6:
            s[j] = 0
            j += i          
z = set()
for i in range(len(s)):
    if s[i] != 0 and s[i] != 1:
        z.add(s[i])       
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
    if int(n**0.5) != n**0.5:
        print("NO")
    elif a[i]**0.5 in z:
        print("YES")
    else:
        print("NO")       