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.
from math import sqrt

#create prime lst
limit = 1000000
lst = [True] * limit
lst[0] = lst[1] = False
for i in range(limit):
    if lst[i] == True:
        for j in range (i*i, limit, i):
            lst[j] = False
    
cases = int(input())
num_lst = input().split()

for n in num_lst:
    n = int(n)
    if n == 4: print("YES")
    elif n % 2 == 0: print("NO")
    else: 
        root = sqrt(n)
        if root.is_integer() and lst[int(root)]:
            print("YES")
        else:
            print("NO")
