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())
numbers=list(map(int,input().split()))
for number in numbers:
    a=math.sqrt(number)
    if a!=math.floor(a) or number==1:
        print('NO')
    else:
        A=int(a)
        b=0
        lst=[i for i in range(A//2+1)]
        s={j for j in range(2,A//2+1)}
        for x in s:
            if A%x==0:
                b+=1
                break
            else:
                s=s-set(lst[x*2::x])
                
        if b==0:
            print('YES')
        else:
            print('NO')