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.
import math as m

def judge(x):#判断质数
    if x==1:
        return 0
    if x==2:
        return 1
    if x%2==0:
        return 0
    q=3
    while q*q<=x:
        if x%q==0:
            return 0
        q+=2
    return 1   
        
n=int(input())
nums=map(int,input().split())
for num in nums:
    if m.sqrt(num)%1!=0:
       print('NO')
    elif judge(m.sqrt(num))==0:
       print('NO')
    else:
       print('YES')
