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
n1 = 1000005
pa = [1]*(n1+1)
pa[0]= pa[1]= 0
for i in range(2, int(math.sqrt(n1)+1)):
    if pa[i] == 1:
        j =i
        while i*j <= n1:
            pa[i*j] = 0
            j+=1

n = int(input())
arr = list(map(int, input().split()))
for i in range(n):
    s = int(math.sqrt(arr[i]))
    if s*s == arr[i] and pa[s] ==1:
        print("YES")
    else:
        print("NO")





