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
n = int(input())

def isprime(n):
    if n == 2:
        return True
    for i in range(2,math.ceil(math.sqrt(n))+1):
        if n % i == 0:
            return False;

    return True;

arr = list(map(int, input().split()))

for i in arr:
    if isprime(i):
        print("NO")
    else:
        count = 0;
        for j in range(1,i+1):
            if count > 3:
                break;
            if i % j == 0:
                count += 1; 
        if count == 3:
            print("YES")
        else:
            print("NO")
