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 euler_sieve():
    for i in range(2,m+1):
        if status[i]:
            if n%i==0:
                return i
            primes.append(i)
        for pj in primes:
            if pj*i>m:
                break
            status[pj*i]=False
            if i%pj==0:
                break
    return 0
t=int(input())
nums=list(map(int,input().split()))
for i in range(t):
    n=nums[i]
    m=int(math.sqrt(n))
    primes=[]
    status=[False]*2+[True]*(m-1)
    pr=euler_sieve()
    if pr and pr**2==n:
        print("YES")
    else:
        print("NO")