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 19:43:10 2023

@author: He'Bing'Ru
"""

#找素数
def eratosthenes(n):
    primes = [True for _ in range(n+1)]
    p = 2
    
    while p**2 <= n:
        if primes[p] == True:
            for i in range(p**2, n+1, p):
                primes[i] = False
        p += 1
    
    primes_list = [p for p in range(2, n+1) if primes[p]]
    return primes_list

primes_list = eratosthenes(10**12)

import math
flag = False

n = int(input())
array = list(map(int,input().split()))
end = []

for num in array :
    
    
    if (int(math.sqrt(num))**2 == num)and(int(math.sqrt(num)) in primes_list) :
        end.append('YES')
    else:
        end.append('NO')
    
for _ in end :
    print(_)