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.
function generatePrimes(n):
    is_prime = array of size n, initialized with true
    primes = empty array

    is_prime[0] = is_prime[1] = false
    for i from 2 to sqrt(n):
        if is_prime[i]:
            for j from i*i to n step i:
                is_prime[j] = false

    for i from 2 to n:
        if is_prime[i]:
            add i to primes

    return primes

function isPrime(x, primes):
    if x < 2:
        return false
    for prime in primes:
        if prime > sqrt(x):
            break
        if x % prime == 0:
            return false
    return true

n = read_int()
array = read_array_of_integers(n)
max_num = maximum value in array

primes = generatePrimes(sqrt(max_num))

for i from 0 to n-1:
    sqrt_x = square root of array[i]
    if sqrt_x * sqrt_x == array[i] and isPrime(sqrt_x, primes):
        print("YES")
    else:
        print("NO")
