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.
def euler(x):
    is_prime = [True] * (x + 1)
    primes = []
    for i in range(2, x + 1):
        if is_prime[i]:
            primes.append(i)
        for j in range(len(primes)):
            if i * primes[j] > x:
                break
            is_prime[i * primes[j]] = False
            if i % primes[j] == 0:
                break
    return primes


input()
*nums, = map(int, input().split())
max_num = max(nums)
primes = euler(int(max_num ** 0.5) + 1)
for num in nums:
    if (sq := num ** 0.5) == int(sq) and sq in primes:
        print('YES')
    else:
        print('NO')
