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.
# -*- coding: utf-8 -*-
"""
Created on Wed Oct 11 12:17:43 2023

@author: 25419
"""

def primes(n):
    p=[]
    f=[]
    for i in range(n+1):
        if i>2 and i%2 == 0:
            f.append(1)
        else:
            f.append(0)
    i=3
    while i*i<=n:
        if f[i]==0:
            j=i*i
            while j<=n:
                f[j]=1
                j+=2*i
        i+=2

    p.append(2)
    for x in range(3,n+1,2):
        if f[x] == 0:
            p.append(x)

    return p

n=10**12
p=primes(n)
m=int(input())
list1=input().split()
for i in range(m):
    if list1[i]**0.5 in p:
        print('YES')
    else:print('NO')