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 math import sqrt
primes=[2]

def isprime(n:int)->bool:
    global primes
    if n<=primes[-1]: return True if n in primes else False
    else:
        if (s:=int(sqrt(n))+1)<=primes[-1]:
            for prime in primes:
                if n%prime==0:
                    return False
            return True
        else:
            for i in range(primes[-1]+1,s+1):
                for prime in primes:
                    if n%prime==0:return False
                check=0
                for prime in primes:
                    if i%prime==0:
                        check+=1
                        break
                if check!=0:continue
                primes.append(i)
            return True

def isTprime(n:int)->str:
    sq=int(sqrt(n))
    return 'YES' if sq*sq==n and isprime(sq) else 'NO'
    
n=int(input())
l=list(map(int,input().split()))
dic={}
for i in l:
    if i not in dic:
        dic[i]=isTprime(i)
    print(dic[i])