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())
numlist=list(map(int, input().split()))

for i in range(n):
    if numlist[i]==2:
        print('NO')
    if numlist[i]==3:
        print('NO')
    if numlist[i]%2==0 and numlist[i]%3==0:
        print('NO')
    else:
        j=2
        count=2
        while(j*j<=numlist[i]):
            if(numlist[i]%j==0):
                count+=1
            j+=1
        if count==3:       
            print('YES')
        else:
            print('NO')