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
def is_prime(m):
    if m < 2:
        return False
    # 对 m 进行开方，只需要验证 2 到 sqrt(m) 之间的数即可
    sqrt_m = int(math.sqrt(m))
    for i in range(2, sqrt_m + 1):
        if m % i == 0:
            return False
    return True
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
    number=a[i]
    out="NO"
    m=int(math.sqrt(number))
    if m**2 == number:
        if is_prime(m):
            out="YES"
    print(out)
