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.
n=int(input())
numbers=input().split()
for i in range(n):
    x=int(numbers[i])
    y=x**0.5
    if x==1:
        print('NO')
    elif y==int(y):
        if int(y)==2:
            print('YES')
        elif int(y)%2!=0:
            for ii in range(3,int(y)+1,2):
                if int(y)%ii==0:
                    print('NO')
                    break
            print('YES')
    else:
        print('NO')
        
        