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 SieveOfEratosthenes(num):
    prime = [True for i in range(num+1)]
# boolean array
    p = 2
    while (p * p <= num):
 
        # If prime[p] is not
        # changed, then it is a prime
        if (prime[p] == True):
 
            # Updating all multiples of p
            for i in range(p * p, num+1, p):
                prime[i] = False
        p += 1
 
    # Print all prime numbers
    return prime

def solve():
    N = int(input())
    arr = inparr()
    primes = SieveOfEratosthenes(int(1e6))
    for i in arr:
        if int(i**0.5)==i**0.5:
            if primes[int(i**0.5)]:
                print("YES")
                continue
        print("NO")


for _ in range(1):
    solve()