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()
ok=set()
false=set()
for i in nums:
    if i in ok:
        print("YES")
    elif i in false:
        print("NO")
    else:
        if int(i**0.5)==i**(0.5) and i !=1:
            if i==4:
                print('YES')
                ok.add(i)
            else:
                sq=int(i**0.5)
                k=int(i**0.25)+1
                j=2
                while j < k:
                    if sq % j== 0:
                        false.add(i)
                        print("NO")
                        break
                    else:
                        j+=1   
                    if j==k:
                        ok.add(i)
                        print('YES')
        else:
            print("NO")
            false.add(i)
            

