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.
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Mon Oct 16 17:05:36 2023

@author: huangxiaoyuan
"""

def prime(x,y):
    p=2
    while p*p<=x:
        if y[p]==True:
            for i in range(p*p,x+1,p):
                y[p]=False
        p+=1
                
n=int(input()) 
s=[int(j) for j in input().split()]
y=[True]*(10**6+1)
prime(10**6, y)

for m in s:
    if m<4:
        print('NO')
        continue
    elif (m**0.5)%1!=0:
        print('NO')
        continue
    print(['NO','YES'][y[int(m**0.5)]])
        
    
    