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
N=1e4+1
isprime=[]
n=int(input())
nums=list(map(int,input().split()))
def is_prime():
    isprime.append(0,1)
    for a in range(3,N):
        if a%2==0:
            isprime.append(0)
            continue
        for i in range(3,int(a**0.5)+1,2):
            if a%i==0:
                isprime.append(0)
                continue
        isprime.append(1)

for i in range(n):
    if math.sqrt(nums[i])%1==0:
        if isprime(math.sqrt(nums[i])):
            print("YES")
    else:
        print("NO")    
    
