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 15:15:05 2023

@author: zinc 2300012115
"""

import math

def primecheck(x):
    st = True
    if x == 2:
        return True
    elif x <= 1:
        return False
    elif x % 2 == 0:
        return False
    else:
        for i in range(2,math.ceil(x**0.5)+1):
            if x%i == 0:
                st = False
                break
            else: 
                pass
        return st
    
def check(x):
    if x == 1:
        return False
    elif x == 2:
        return False
    elif x%2 == 0:
        if x%4 == 0:
            return True
        else:
            return False
    else:
        sqrt_x = int(math.sqrt(x))
        if sqrt_x**2 == x:
            if primecheck(sqrt_x) == True:
                return True
            else:
                return False
        else:
            return False
            
n = int(input())
test = [int(x) for x in input().split()]
for k in test:
    if check(k) == True:
        print('YES')
    else:
        print('NO')