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.
from sys import stdin
from math import pow
def input(): return stdin.readline()[:-1]

def eureka(i):
    a=(i**0.5)
    if a%1==0:
        b=a//1
        if b==1:
            print('NO')
            return
        elif b==2:
            print('YES')
            return
        if b%2==0:
            print('NO')
            return
        else:
            for i in range(5,int(pow(b,0.5))+1,6):
                if b%i or b %(i+2)==0:
                    print('NO')
                    return
        print('YES')
    else:
        print('NO')
    
n=int(input())
l=list(map(int,input().split()))
for i in l:
    eureka(i)
