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 sieve_of_eratosthenes():
    limit = (10 ** 6) + 1
    primes = [True for i in range(limit)]
    primes[0] = False
    primes[1] = False
    primes[2] = True

    p = 2

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

    return primes


primes = sieve_of_eratosthenes()

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

for i in numbers:
    square = math.sqrt(i)
    if square.is_integer():
        square = int(square)
        if primes[square] == True:
            print("YES")
        else:
            print("NO")
    else:
        print("NO")

