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
"""

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

for num in array :
    div = 0
    
    if num%2 == 0 :
        for i in range(1,int(num/2)) :
            if num%i == 0 :
                div += 2
            else:
                continue
        div += 1
        
    elif num%2 != 0 :
        for i in range(1,int(num/2)+1) :
            if num%i == 0 :
                div += 2
            else:
                continue
    
    if div == n :
        end.append('YES')
    else:
        end.append('NO')
        
for _ in end :
    print(_)