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 prenum(x):
    pre = list(range(x+1))
    pre[0],pre[1]=-1,-1
    for j in range(x+1):
        if pre[j]!=-1:
            for k in range(2*j,x+1,j):
                pre[k]=-1
    return pre


n=int(input())
alll=list(map(int, input().split()))
for i in range(n):
    a = math.sqrt(alll[i])
    if a!=int(a):
        print('NO')
    else:
        a=int(a)
        if a == prenum(a)[-1]:
            print('YES')
        else:
            print('NO')