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):
    if num<=3:
        return False
    elif num%2==0 and num>4:
        return False
    elif num%3==0 and num>9:
        return False
    elif num%5==0 and num>25:
        return False
    elif num%7==0 and num>49:
        return False
    elif num**(0.5)%1!=0:
        return False
    else:
        list2=[]
        for x in range(1,num+1):
            if num%x==0:
                list2.append(x)
        if len(list2)==3:
            return True
        else:
            return False


n=int(input())
list1=input().split()
for i in range(0,n):
    if t_prime(int(list1[i]))==True:
        print('YES')
    else:
        print('NO')
