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 prime_number(number):
    if number==1:
        return 0
    else:
        test=1
        for i in range(2,int(number**(1/2))+1):
            if number%i==0:
                test=0
                break
        return test

test_time=int(input())
numbers=[]
for number in input().split():
    numbers.append(int(number))
for testing in numbers:
    if testing**(1/2) % 1==0.0:#根号下是浮点数
        test_number=int(testing**(1/2))
        if prime_number(test_number):
            print("YES")
        else:
            print("NO")
    else:
        print("NO")