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 21:28:43 2023

@author:GaoMingze 2300011427
"""
import math
tprime=[]
def istprime(n):
    check=['1' for i in range(n+2)]
    a=math.ceil((n+2)**0.5)
    for i in range(2,a+1):
        if check[i]=='1':
            tprime.append(i**2)
            for j in range(i+1,n+2):
                if j%i==0:
                    check[j]==0
    return tprime
n=int(input())               
number=list(map(int,input().split()))
b=max(number)
istprime(b)
for i in number:
    if i in tprime:
        print('YES')
    else:
        print('NO')