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 Sat Oct 14 20:27:14 2023

@author: 20311
"""
def isprime(a):
    if a<2:
        return False
    elif a==2:
        return True
    else:
        for i in range(3,math.ceil(math.sqrt(a)),2):
            if a%i==0:
                return False
        return True
    
def check(a):
    b=int(math.sqrt(a))
    if b**2==a:
        if isprime(b):
            print('YES')
        else:
            print('NO')
    else:
        print('NO')

import math

input()
A=list(map(int,input().split()))
for a in A:
    check(a)