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


n = int(input())
prime_list = if_prime(n)
list_ = [int(x) for x in input().split()]
for i in list_:
    a = int(math.sqrt(i))
    if a ** 2 == i:
        if prime_list[a]:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')