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 Mon Oct 16 23:29:43 2023

@author: 刘婉婷 2300012258
"""

import math

# Function to precompute prime numbers up to the square root of 10^12
def sieve(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = is_prime[1] = False
    for p in range(2, int(math.sqrt(n) + 1)):
        if is_prime[p]:
            for i in range(p * p, n + 1, p):
                is_prime[i] = False
    primes = [i for i in range(2, n + 1) if is_prime[i]]
    return set(primes)

# Precompute prime numbers
primes = sieve(int(math.sqrt(10**12)))

# Read input
n = int(input())
numbers = list(map(int, input().split()))

# Check if each number is T-prime
for xi in numbers:
    root = int(math.sqrt(xi))
    
    if xi in primes and root * root == xi:
        print("YES")
    else:
        print("NO")

    
    