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 sushu(n):
    primes=[True]*(n+1)
    primes[0]=primes[1]=False
    x=2
    while x*x<=n:
        if primes[x]:
            for i in range(x*x,n+1,x):
                primes[i]=False
        x+=1
    return primes
#读取输入
n=int(input())
numbers=list(map(int,input().split()))
m=max(numbers)
primes=sushu(int(math.sqrt(m))+1)
for number in numbers:
    a=math.sqrt(number)
    A=int(a)
    if A*A!=number:
        print('NO')
    else:
        if primes[A]:
            print('Yes')
        else:
            print('NO')