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(a):
    import math
    if int(a) == 1:
        return False
    for x in range(2, int(math.sqrt(a)) + 1):
        if a % x == 0:
            return False
    return True'''


def prime(a):
    if n < 2:
        return False

    prime_ = [True] * (n + 1)
    prime_[0] = prime_[1] = False

    p = 2
    while p * p <= n:
        if prime_[p] == True:
            for i in range(p * p, n + 1, p):
                prime_[i] = False
        p += 1

    return prime[n]
n = int(input())
num = list(map(int, input().split()))
import math
for i in num:
    if math.isqrt(i) ** 2 == i:
        a = int(math.sqrt(i))
        if prime(a) == False:
            print('NO')
        else:
            print('YES')
    else:
        print('NO')



