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.
N = int(input())
# Time Complexity => O(N * sqrt(M))
a = list(map(int, input().split()))
from math import ceil, sqrt, floor

def is_perfect_square(N: int) -> bool:
    l, r = 1, N

    while l < r:
        mid = (l+r)//2
        sq = mid ** 2
        if sq > N:
            r = mid - 1
        elif sq <  N:
            l = mid + 1
        else:
            return True
    return False
for num in a:
    #s = sqrt(num)

    if is_perfect_square(num):
        print("YES")
    else:
        print("NO")