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 sys
from collections import Counter,deque
from math import ceil, comb, floor, log, log2,gcd,factorial,perm
RMOD = int(1e9) + 7
def inparr():
    tmparr = [int(i) for i in input().split()]
    return tmparr
 
def getFact(x):
    fact = {1,x}
    for i in range(2,int(x**0.5)+1):
        if x%i==0:
            fact.add(x//i)
            fact.add(i)
    return fact
def solve():
    N = int(input())
    arr = inparr()
    for i in arr:
        if len(getFact(i))==3:
            print("YES")
        else:
            print("NO")


for _ in range(1):
    solve()