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())
a=[int(x) for x in input().split()]
for i in range(n):
    book=0
    s=int(a[i]**0.5)
    if s**2==a[i] and a[i]!=1:
        if s!=2:
            for j in range(2,s):
                if s%j==0:
                    book=1
                    break
        if book==0:
            print("YES")
        else:
            print("NO")
    else:
        print("NO")