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 Tue Oct 17 15:28:23 2023

@author: 苏柔德 2300011012
"""
import math
n = int(input())
nums = list(map(int, input().split()))
mx = max(nums)
primeend = math.isqrt(mx) + 2

prime=[1]*mx  
tprime=set() 

#筛质数
for i in range(2, n):
    if prime[i]==1:
        tprime.add(i*i)
        for j in range(i*i,mx,i):  # 将i的倍数标记为合数
            prime[j] = 0
for t in nums:
    if t in tprime:
        print('YES')
    else:
        print('NO')