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

def is_prime(num):
    if num<=1:
        return False
    else:
        list1=[]
        status=[0 for x in range(num)]#0代表初始都是素数
        for i in range(2,num+1):
            for j in range(2,i+1):
                if i*j>num:
                    break
                else:
                    status[i*j-1]=1#1代表是合数
                if i%j==0:
                    break
        if status[num-1]==0:
            return True
        else:
            return False










n=int(input())
b=input().split()
for x in range(n):
    a=int(b[x])
    if a**0.5%1==0:
        if is_prime(int(a**0.5))==True:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')


