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.
primes = [True for _ in range(1, 10**6+1)]
primes[0] = primes[1] = primes[3] = True
for i in range(2, 10**6+1):
    if primes[i-1]:
        for j in range(i+i, 10**6+1, i):
            primes[j-1] = False


from math import sqrt
n = int(input())
numbers = list(map(int, input().split()))
for e in numbers:
    if round(sqrt(e))**2 == e:
        if primes[int(sqrt(e))-1]:
            print("YES")
    else:
        print("NO")