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 arrayPrime(a):
    result = []
    for i in a:
        if hasExactlyThreeDivisors(i):
            result.append("YES")
        else:
            result.append("NO")
    return result

def hasExactlyThreeDivisors(n):
    if n < 4:
        return False
    count_divisors = 0
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            count_divisors += 1
            if count_divisors > 1:
                return False
    return count_divisors == 1

if __name__ == "__main__":
    n = int(input())
    a = list(map(int, input().split()))
    results = arrayPrime(a)
    for result in results:
        print(result)
