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:01:33 2023

@author: Pomfret Du
"""

n = int(input())
row = list(map(int,input().split()))

for i in range(n):
    if row[i] in row[:i]:
        print('YES')
    else:
        a = row[i]**(1/2)
        init = True
        if a % 1 == 0 and row[i] != 1:
            for j in range(2,int(int(a)**(1/2))):
                if a%j == 0:
                    init = False
                    break
            if init:
                print('YES')
            else:
                print('NO')
        else:
            print('NO')