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.
n=int(input())
s=input()
if(n==len(s)):
    
    for i in range(0,len(s)):
        count=0
        if(int(s[i])<=3):
            print("NO")
            break
        else:
            for w in range(3, int(int(s[i])**0.5) + 1, 2):
                if n % w == 0:
                    count=count+1
            if(count==3):
                print("YES")
            else:
                print("NO")