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 10 22:26:27 2023

@author: Pomfret Du
"""

n = int(input())
row = list(map(int,input().split()))
row = list(map(lambda x:x**(1/2),row))

number = [True for i in range(int(max(row)**(1/2)))]
prime = []
for i in range(1,int(max(row)**(1/2))):
    if number[i]:
        prime.append(i+1)
    for j in prime:
        try:
            number[(i+1)*j-1] = False
        except:
            break
        if (i+1)%j == 0:
            break

list_0 = [[0,0,x] for x in prime]
list_0 += list([1,i,row[i]] for i in range(n))
list_0.sort(key=lambda x:x[2])
for i in range(1,len(list_0)):
    if list_0[i][2] == list_0[i-1][2] and list_0[i-1][0] == 0:
        list_0[i][0] = 0
        row[list_0[i][1]] = -1
for i in row:
    if i == -1:
        print('YES')
    else:
        print('NO')