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.
prime=[2,3]
l=2
def pr(m):
    '''if m< prime[l-1] :
        if m in prime:
            print('YES')
            return 0
        print('NO')
        return 0'''
    if m==2:
        print('YES')
        return 0
    for i in range(2,int(m**0.5)+2):
        if m%i==0:
            print('NO')
            return 0
    print('YES')
    return 0
n=int(input())
a=list(map(int,input().split()))
for item in a:
    if int(item**0.5)**2 ==item :
        pr(int(item**0.5))
    elif (int(item**0.5)+1)**2 ==item:
        pr(int(item**0.5)+1)
    else:
        print('NO')
