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.
def prime(z):
    if z == 2:
        return [2]
    s = 0
    for a in prime(z-1):
        if z % a == 0:
            s = 1
            break
        else:
            continue
    if s == 0:
        return prime(z-1)+[z]
    else:
        return prime(z-1)


n = int(input())
A = list(map(int, input().split()))
a = max(A)
P = []
for i in range(2, int(a**0.5)+2):
    if i in prime(a):
        P.append(i**2)
    else:
        pass
for x in A:
    if x in P:
        print('YES')
    else:
        print('NO')
