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())
b=[int(i) for i in input().split()]
for i in range(n):
    a=b[i]
    val=1
    aa=math.ceil(a**0.5)
    #print(aa)
    if aa*aa==a:
        for k in range(2,math.ceil(aa**0.5)+1):
            if aa%k==0:
                val=0
                break
        if aa==2:
            val=1
    else:
        val=0
    if val:
        print("YES")
    else:
        print("NO")