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 math
def isprime(n):
    if type(n) == type(2.0) or n == 1: return False
    if n == 2: return True
    if n % 2 == 0: return False
    counter = 0
    for factor in range(2, int(n + 1/2)):
        if n % factor == 0:
            counter += 1
    return True if counter == 0 else False
def istprime(n):
    a = math.sqrt(n)
    if abs(a - int(a)) <= 10 ** -6: a = int(a)
    return 'YES' if isprime(a) == True else 'NO'

n = int(input())
ints = list(map(int, input().split()))
for i in range(n):
    print(istprime(ints[i]))