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.
s = int(input())
a = list(map(int,input().split()))
for i in a :
    g = int((i)**0.5)
    if (g*g) == i :
        if g % 2 == 0 or g % 3 == 0 :
            if g!=2 and g!=3:
                print("NO")
            else :
                print("YES")
        else :
            print("YES")
    elif (g*g) != i or g == 1 :
        print("NO")
