from functools import cache
from bisect import bisect_left, bisect_right
import heapq
from itertools import product
from itertools import permutations
import random
import math
import bisect
import sys
from collections import defaultdict
from itertools import combinations
sys.setrecursionlimit(10**7)
inf = 1 << 60


def sgn(x):
    if x > 0:
        return 1
    elif x == 0:
        return 0
    else:
        return -1


def popC(x):
    ans = 0
    while x != 0:
        ans += x % 2
        x //= 2
    return ans


def exit():
    sys.exit()


def LI():
    return list(map(int, input().split()))


def II():
    return int(input())


def SI():
    return input()


t = int(input())
y = LI()
ans = [True, True]
ps = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
      43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
dp = [False] * 1061
dp[0] = True
for x in ps:
    ndp = [False]*1061
    for i in range(1061):
        if dp[i]:
            ndp[i+x] = True
            ndp[i] = True
    dp = ndp
for x in range(t):
    if y[x] >= 100:
        print("Yes")
    else:
        print("Yes" if dp[y[x]] else "No")