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 sieve_of_eratosthenes(n):
    primes = [True] * (n + 1)
    primes[0] = primes[1] = False

    p = 2
    while p ** 2 <= n:
        if primes[p]:
            for i in range(p * p, n + 1, p):
                primes[i] = False
        p += 1

    return primes

def is_square(num):
    root = int(num ** 0.5)
    return root * root == num


n = int(input())
nums = list(map(int, input().split()))


limit = int(max(nums) ** 0.5) + 1
primes = sieve_of_eratosthenes(limit)


for num in nums:
    if is_square(num):
        root = int(num ** 0.5)
        if root == 2 or (root % 2 != 0 and primes[root]):
            print("YES")
        else:
            print("NO")
    else:
        print("NO")


