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.
n = int(input())
l = list(map(int, input().split()))
a = [2]
c = [False]*(int(max(l)**.5)+1)
c[1] = True
for i in range(3, len(c), 2):
    b = True
    for j in a:
        if i % j == 0:
            b = False
            break
        if j**2 > i:
            break
    if b:
        a.append(i)
        c[i-1] = True
for i in range(0, n):
    if int(l[i]**.5) != l[i]**.5:
        print('NO')
    else:
        if c[int(l[i]**.5)-1]:
            print('YES')
        else:
            print('NO')
