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 Fri Oct 13 23:03:56 2023

@author: 赵语涵
"""

useless = int(input())
tests = list(map(int,input().split()))
n = round(max(tests)**(1/2))
check = [1]*(n-1)
primes = []
for i in range(2,n+1):
    if check[i-2] == 1:
        primes.append(i)
        for j in range(2,n//i+1):
            check[i*j-2] = 0
answers = []
for x in tests:
    y = round(x**(1/2))
    if y**2 == x and y in primes:
        answers.append('YES')
    else:
        answers.append('NO')
for answer in answers:
    print(answer)