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())
a = [int(i) for i in input().split()]

a1 = [i for i in a if int(math.sqrt(i))**2 == int(i)]
p1=[0]*n
m = max(a1)
p = [0]*(m+1)
for i in range(2,m+1):
    if p[i] == 0:
        j=2
        while i*j <m:
            p[i*j] = 1
            j+=1


for i in range(n):
    if a[i] in a1:
        if p[int(math.sqrt(a[]))] == 0:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')