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.
N = int(input())
a = list(map(int, input().split()))

max_num = 1000001
from math import sqrt, ceil, floor
from typing import List
primes = [True] * (max_num + 1) # to use true indexing
def sieve() -> List[int]:
    
    i = 2
    while i ** 2 <= max_num:
        if primes[i]:
            j = i * 2
            while j <= max_num:
                primes[j] = False
                j += i
        i += 1



def is_prime(N: int) ->bool:
    return primes[N]
    
for num in a:
    sieve() # O(Nlog(logN))
    s = sqrt(num) # O(logN)
    if ceil(s) == floor(s) and is_prime(floor(s)):
        print("YES")
    else:
        print("NO")