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
import random
def power(a,n,p) :
    res = 1
    while n > 0:
        if n & 1:
            res = (res * a)%p
        a = (a*a)%p
    return res
def is_prime(n,k=10):
    if n <= 1 or n == 4:
        return False
    if n <= 3:
        return True
    r,d = 0, n-1
    while d % 2 == 0:
        r += 1
        d //= 2
    for _ in range(k):
        a = random.randint(2,n-2)
        x = power(a,d,n)
        if x == 1 or x == n-1:
            continue
        for _ in range(r-1):
            x = (x*x)%n
            if x == n-1:
                break
        else:
            return False
    return True
num = int(input())
line = list(map(int,input().split()))
for i in line:
    if round(math.sqrt(i))**2 == i:
        check = round(math.sqrt(i))
        prime = is_prime(check)
        if prime:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')