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 Sat Oct 14 10:41:41 2023

@author: 2300011376
"""
import math
def check(x):
    x=int(x)
    A=0
    #0 for prime number ,1 for composite number
    y=int(math.sqrt(x))
    if y**2==x:
        y=int(y)
        z=math.sqrt(y)
        if y==2:
            return A
        else:
            for i in range(2,z+1):
                if y%i==0:
                   A=1
                   return A
                   break
    else:
        A=1    
    return A
L=input()
lis=list(input().split())
for i in lis:
    i=int(i)
    if check(i)==0:
        print('YES')
    elif check(i)==1:
        print('NO')
