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.
from math import sqrt
def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = is_prime[1] = False  # 0和1不是质数

    for i in range(2, int(n**0.5) + 1):
        if is_prime[i]:
            for j in range(i*i, n + 1, i):
                is_prime[j] = False

    primes = [num for num in range(2, n + 1) if is_prime[num]]
    return primes
def is_prime(n):
    if n==0 or n==1:
        return False
    elif n == 2:
        return True
    else:
        for i in range(2, int(n ** 0.5) + 1):
            if is_prime(i):
                if n in range(i*i,n+1,i):
                    return False
            else:
                continue
        return True
import random

def is_prime_miller_rabin(n, k=5):
    if n <= 3:
        return n == 2 or n == 3

    # 将 n - 1 表示为 2^r * d 的形式
    r, d = 0, n - 1
    while d % 2 == 0:
        r += 1
        d //= 2

    # 进行 k 次测试
    for _ in range(k):
        a = random.randint(2, n - 2)
        x = pow(a, d, n)
        if x == 1 or x == n - 1:
            continue
        for _ in range(r - 1):
            x = pow(x, 2, n)
            if x == n - 1:
                break
        else:
            return False

    return True

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

for number in numbers:
    if number == 4:
        print("YES")
        continue
    Lastdigit=str(number)[-1]
    if Lastdigit == "1" or Lastdigit == "5" or Lastdigit == "9":
        if sqrt(number)==int(sqrt(number)) and is_prime_miller_rabin(int(sqrt(number))) :
            print("YES")
        else:
            print("NO")
    else:
        print("NO")