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 13:30:16 2023

@author: 25419
"""

from functools import lru_cache

@lru_cache(maxsize=None)
def is_prime(n):
    if n < 2:
        return False
    elif n == 2 or n == 3:
        return True
    elif n % 2 == 0:
        return False
    elif n % 3 == 0:
        return False
    else:
        i = 5
        while i*i <= n:
            if n % i == 0:
                return False
            elif n % (i+2) == 0:
                return False
            i += 6
        return True

@lru_cache(maxsize=None)
def primes(n):
    primes = []
    for i in range(2, n+1):
        if is_prime(i):
            primes.append(i**2)
    return primes

n = int(input())
list1 = input().split()
for i in range(n):
    if int(list1[i]) in primes(int(list1[i])):
        print('YES')
    else:
        print('NO')
