def get_prime(n):
    sieve = [True] * (n + 1) 
    i = 2
    while i * i <= n: 
        if sieve[i]:
            for j in range(i * i, n + 1, i):
                sieve[j] = False
        i += 1
    return [i for i in range(2, n + 1) if sieve[i]]

l = get_prime(4000)
print(len(l))
ll = [a*b*c for a in l for b in l for c in l]
s = set(ll)

q = int(input())
for _ in range(q):
    n = int(input())
    if n in s:
        print('Yes')
    else:
        print('No')