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.
def primes(n):
    L = [True] * (n + 1)
    L[0] = L[1] = False
    p = 2
    while p ** 2 <= n:
        if L[p]:
            yield p
            for i in range(p ** 2, n + 1, p):
                L[i] = False
        p += 1

n = int(input())
num = input().split()
for i in range(n):
    flag = 0
    num[i] = int(num[i])
    for p in primes(num[i]):
        if p ** 2 == num[i]:
            print('YES')
            break
        else:
            flag += 1
    if flag == len(list(primes(num[i]))):  # 如果需要转换为列表再计算长度
        print('NO')
