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():
    primes_state = [False for i in range(320)]
    primes_state[2] = True
    primes = []
    primes.append(2)

    for i in range(3, 320, 2):
        for a in primes:
            if i % a != 0:
                primes_state[i] = True
            else:
                primes_state[i] = False
                break
        if primes_state[i] == True:
            primes.append(i)        

    return primes
            

primes = sieve_of_eratosthenes()

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

for i in numbers:
    if math.sqrt(i) in primes:
        print("YES")
    else:
        print("NO")


