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.
num=int(input())
nums=list(map(int,input().split()))
first=set()
for i in nums:
    if int(i**0.5)==i**(0.5):
        if i==4:
            print('YES')
        else:
            sq=int(i**0.5)
            k=int(i**0.25)+1
            count=0
            for j in range(1,k+1):
                if sq % j== 0:
                    count+=1
            if count==1:
                print('YES')
            else:
                print("NO")
    else:
        print("NO")
            