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.
ran = 100000

prime = [True for i in range(ran+1)]

i = 2

while i*i<=ran:

    if prime[i] == True:

        for j in range(i*i, ran+1, i):
            prime[j] = False

    i+=1


nums = [i for i in range(2,ran+1) if prime[i] == True]

n = int(input())
li = list(map(int , input().split(' ')))
result = "No"


for i in li[0:n]:
    if i%2 != 0 or i == 4:
        for j in nums:
            if i%j == 0:
                if i == 5:
                    result = "NO"
                else:
                    result = "YES"

        print(result)

    else:
        print("NO")

