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 Wed Oct 11 20:53:36 2023

@author: masiyu004
"""

n=int(input())
x=list(map(int,input().split()))
for i in range(n):
    if x[i]==1:
        print('NO')
    else:
        a=x[i]**(1/2)
        s=str(a).split('.')
        if float(s[1])==0:
            k=0
            for i in range(0,int(a)):
                if a%i==0:
                    k=1
            if k==0:
                print('YES')
            else:
                print('NO')
                
        else:
            print('NO')
    
     