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.
def euler(n):
    flags = [True for i in range(n+1)]
    primes = []
    for i in range(2,n+1):
        if flags[i]:
            primes.append(i)
        for j in primes:
            if j*i > n:
                break
            flags[j*i] = False
            if i%j == 0:
                break
    return primes


answers = [i**2 for i in euler(1000)]
number = int(input())
data = [int(i) for i in input().split()]
for i in range(number):
    if  data[i] in answers:
        print('YES')
    else:
        print('NO')