from math import sqrt
L, abn, p23 = 20162, set(), []

#  Find the sum of divisors for every number [2, L]
ds = [1]*L
for i in range(2, int(sqrt(L))+1): ds[i*i]+= i  # Include squares
for i in range(2, int(sqrt(L))+1):
    for j in range(i+1, L//i):
        ds[i*j]+= i+j
for n in range(1, L):
    if ds[n] > n: abn.add(n)
    if not any( (n-a in abn) for a in abn ): p23.append(n)
 
for _ in range(int(input())):
    print ("NO" if int(input()) in p23 else "YES")