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.
import random

def is_prime(n, k=5):
    if n <= 1:
        return False
    if n <= 3:
        return True

    def witness(a, n):
        t = n - 1
        s = 0
        while t % 2 == 0:
            t //= 2
            s += 1

        x = pow(a, t, n)
        if x == 1 or x == n - 1:
            return True

        for _ in range(s - 1):
            x = pow(x, 2, n)
            if x == n - 1:
                return True

        return False

    for _ in range(k):
        a = random.randint(2, n - 2)
        if not witness(a, n):
            return False

    return True

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

for num in nums:
    if num == 1:
        print('NO')
        continue

    p = int(num ** 0.5)
    if p * p == num and is_prime(p):
        print("YES")
    else:
        print("NO")