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 sys import stdin
def input(): return stdin.readline()[:-1]
def ili(): return list(map(int, input().split()))
import math

def prime(k):
    for i in range(2, math.isqrt(k)+1):
        if k%i == 0:
            return False
    return True

def check(n):
    k = math.isqrt(n)
    if k**2 == n and prime(k):
        return True
    return False

def solve():
    n = int(input())
    s = ili()
    for i in s:
        if i == 1:
            print("no")
            continue
        print("yes") if check(i) else print("no")


case_num = 1
# case_num = int(input())
for case in range(case_num):
    solve()