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 prime(x):
    num=[i+2 for i in range(x-1)]
    prime=[]
    non_prime=[4]
    for i in num:
        if i in non_prime:
            continue
        else:
            n=2
            prime.append(i)
            while n*i<=x:
                if n*i in non_prime:
                    n+=1
                else:
                    non_prime.append(n*i)
                    n+=1
    return prime

n=int(input())
numbers=list(map(int,input().split()))
for i in numbers:
    maximum=math.ceil(math.sqrt(i))
    primes=prime(maximum)
    if primes[-1]**2==i:
        print('YES')
    else:
        print('NO')