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.
# -*- coding: utf-8 -*-
"""
Created on Tue Oct 10 14:12:38 2023

@author: 25419
"""

primes=[4,9,25]
for i in range(6,10**6):
    for j in range(2,i//2+1):
        if i%j==0 and j!=i//2:
            continue
        elif i%j!=0 and j==i//2:
            primes.append(i**2)

n=int(input())
list1=input().split()
for i in range(n):
    if int(list1[i]) in primes:
        print('YES')
    else:print('NO')