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())
b= [0]*1000001
b[1]=b[0]=1
for i in range(2,1000):
    if not b[i]:
        for j in range(i+i,1000001,i):
            b[j] = 1
for i in range(n):
    x = list(map(int,input().split()))
    for j in range(len(x)):
        t = int(x[j]**0.5)
        if t*t == x[j] and not b[t]:
            print('YES')
        else:
            print('NO')
    
        
        
