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 sqrt


def resheto(N:int):
    a = [2]
    for i in range(2, N + 1):
        if i not in a:
            k = 0
            for j in a:
                if i % j != 0:
                    k += 1
            if k == len(a):
                a.append(i)
    return a


n = int(input())
numbers = list(map(int, input().split()))
primeNumbers = resheto(int(sqrt(max(numbers))) + 1)

for i in range(n):
    if sqrt(numbers[i]).is_integer():
        if sqrt(numbers[i]) in primeNumbers:
            print("YES")
        else:
            print('NO')
    else:
        print("NO")
