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.

import math
n = int(input())
arr = [int(y) for y in input().split()]
def sieve_eratosthenes(limit):
    sieve = [True] * (limit + 1)
    sieve[0] = sieve[1] = False

    for current in range(2, int(limit**0.5) + 1):
        if sieve[current]:
            for multiple in range(current * current, limit + 1, current):
                sieve[multiple] = False

    primes = [num for num, is_prime in enumerate(sieve) if is_prime]
    return primes
limit = 10**6
prime_numbers = set(sieve_eratosthenes(limit))
squares_of_primes = [prime**2 for prime in prime_numbers]

def check_prime_in_list(arr, prime_numbers):
    s=''
    for array in arr:
        
        
        
        if array in prime_numbers:
            s+='YES\n'
        else:
            s+='NO\n'
         
            
        
    return s

limit = 10**6
prime_numbers = set(sieve_eratosthenes(limit))



print(check_prime_in_list(arr, squares_of_primes))


