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.
# Testing Purposes (Remove Below Hashes before upload)
"""
import sys
sys.stdin = open("input.txt", "r")
sys.stdout = open("output.txt", "w")
"""
# Code below 
from math import isqrt


def main():
    n = int(input())
    x = [int(i) for i in input().split()]

    max_x = x[-1] # max x[i] = x[-1]

    # intialisation of prime arrays
    primes = []
    t_primes = []

    # prime array
    for i in range(max_x):
        if is_prime(i):
            primes.append(i)

    # t_prime array
    for i in range(len(primes)):
        t_primes.append( primes[i] * primes[i] )

    # solution
    for i in x:
        if i in t_primes:
            print("YES")
        else:
            print("NO")


def is_prime(n: int):
    if n <= 3:
        return n > 1
    if n % 2 == 0 or n % 3 == 0:
        return False
    limit = isqrt(n)
    for i in range(5, limit+1, 6):
        if n % i == 0 or n % (i+2) == 0:
            return False
    return True

main()