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 solve():
    primes = [0, 0] + [1]*100003
    p = 2
    while (p * p <= 100003):
        if (primes[p] == 1):
            for i in range(p * p, 100004, p):
                primes[i] = 0
        p += 1

    n = int(input())
    num_list = list(map(int, input().split()))

    answer = []
    for num in num_list:
        temp = int(num**(0.5))
        if num == temp * temp and primes[temp] == 1:
            answer.append("YES")
        else:
            answer.append("NO")

    print("\n".join(answer))

solve()
