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())
num = list(map(int,input().split()))
for i in range(n):
    x = num[i]
    if (x == 4) + (x == 9) > 0:
        print('YES')
    else:
        t = 0
        if int(x ** (1/2)) == x ** (1/2):
            t = 1
        elif (x % 2 == 0) + (x % 3 == 0) > 0:
            t = 0
        if t == 1:
            sqr = int(x ** (1/2))
            sqr2 = int(sqr ** (1/2))
            for j in range(2, sqr2):
                if sqr % j == 0:
                    break
                if j == sqr2 - 1:
                    print('YES')
                    t = 2
        if t < 2:
            print('NO')