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 t_prime(num):
    x = num**0.5

    if x==int(x):
        ture = True
        for i in range(2,int(x/2)+1):
            if int(x)%i==0:
                ture = False
            if True:
                break
        if True:
            print('YES')
        else:
            print('NO')
    else:
        print('NO')

if __name__ == '__main__':
    n = int(input())
    num = list(map(int,input().split()))
    for i in num:
        t_prime(i)

