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
prime=[1 for i in range(100001)]
for i in range(2,100001):
    if prime[i]:
        for k in range(i*2,100001,i):
            prime[k]=0
n=int(input())
def is_sp_prime(a,tmp):
    for i in range(2,tmp):
        if prime[i]:
            if a%i==0:
                return 0
    return 1
def is_Tprime(a):
    tmp=math.sqrt(a)
    if int(tmp)==tmp:
        if is_sp_prime(a,int(tmp)):
            return 1
    return 0
arr=list(map(int,input().split()))
for i in arr:
    if i==1 or i==2:
        print("NO")
        continue
    if is_Tprime(i):
        print("YES")
    else:
        print("NO")