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
def find_all_primes():
    arr=[True for i in range(10**6+1)]
    for i in range(2,10**6+1):
        if arr[i]:
            for j in range(i*2,10**6+1,i):
                arr[j]=False
    
    primes=[]
    for i in range(2,10**6+1):
        if arr[i]:
            primes.append(i)
    
    square_primes=set()
    for val in primes:
        square_primes.add(val**2)
    
    return square_primes
    
    
def solve():
    n=int(input())
    a=list(map(int,input().split()))
    square_primes=find_all_primes()
    for val in a:
        if val in square_primes:
            print("YES")
        else:
            print("NO")
            
solve()