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.
from math import ceil


def div(n):
    for i in range(2, n + 1):
        if n % i == 0:
            lst = div(int(n / i))
            lst.append(i)
            return lst
    return []


n = int(input())
a = list(map(int, (input().split())))
for i in a:
    l = div(i)
    j = 1
    while j < len(l):
        if l[j - 1] == l[j]:
            del l[j - 1]
            # if j>=len(l):
            #     break
            continue
        else:
            j += 1
    # print(l)
    if len(l) == 1 and l[0]!=i:
        print("YES")
    else:
        print("NO")
