Problem: 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.

Input

The first line contains a single positive integer, n (1 ≤ n ≤ 105), showing how many numbers are in the array. The next line contains n space-separated integers xi (1 ≤ xi ≤ 1012).

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.

Output

Print n lines: the i-th line should contain "YES" (without the quotes), if number xi is Т-prime, and "NO" (without the quotes), if it isn't.

Examples

Input

3
4 5 6


Output

YES
NO
NO

Note

The given test has three numbers. The first number 4 has exactly three divisors — 1, 2 and 4, thus the answer for this number is "YES". The second number 5 has two divisors (1 and 5), and the third number 6 has four divisors (1, 2, 3, 6), hence the answer for them is "NO".

Solution (in PYTHON3):

Solution:
prime=[2]
for i in range(1007):
    s1=int((i+3)**0.5)
    count=0
    for j in range(s1-1):
        if (i+3)%(j+2)==0:
            break
        else:
            count+=1
    if count==s1-1:
        prime.append(i+3)

n=int(input())
numberlist=[int(x) for x in input().split()]
for i in range(n):
    count=0
    num=numberlist[i]
    s1=int(num**0.5)
    if s1**2==num:
        s2=int(s1**0.5)
        if s2==1 and s1==1:
            print("NO")
        elif s2==2 and s1%2==0:
            print("NO")
        elif s2>2:
            rank=0
            while s2>=prime[rank]:
                if s1%prime[rank]==0:
                    print("NO")
                    break
                else:
                    rank+=1
            else:
                print("YES")
        else:
            print("YES")
    else:
        print("NO")