n = int(input())
A = list(map(int, input().split()))
A.sort()
sumA = sum(A)

q = int(input())
m = list(map(int, input().split()))

def f(A, s, res):
  if res[0]:
    return
  if s == 0:
    res[0] = True
    return
  for i, a in enumerate(A):
    if a > s:
      break
    f(A[i+1:], s-a, res)

for mi in m:
  res = [False]

  if mi <= sumA:
    f(A, mi, res)

  if res[0]:
    print("yes")
  else:
    print("no") n = int(input()) n int(input()) int input() input A = list(map(int, input().split())) A list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split A.sort() A.sort A sort sumA = sum(A) sumA sum(A) sum A q = int(input()) q int(input()) int input() input m = list(map(int, input().split())) m list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split def f(A, s, res):
  if res[0]:
    return
  if s == 0:
    res[0] = True
    return
  for i, a in enumerate(A):
    if a > s:
      break
    f(A[i+1:], s-a, res) f if res[0]:
    return
   res[0] res 0 return if s == 0:
    res[0] = True
    return
   s == 0 s 0 res[0] = True res[0] res 0 True return for i, a in enumerate(A):
    if a > s:
      break
    f(A[i+1:], s-a, res) i a enumerate(A) enumerate A if a > s:
      break
     a > s a s break f(A[i+1:], s-a, res) f A[i+1:] A i+1: i+1 i 1 s-a s a res A A s s res res for mi in m:
  res = [False]

  if mi <= sumA:
    f(A, mi, res)

  if res[0]:
    print("yes")
  else:
    print("no") mi m res = [False] res [False] False if mi <= sumA:
    f(A, mi, res)

   mi <= sumA mi sumA f(A, mi, res) f A mi res if res[0]:
    print("yes")
  else:
    print("no") res[0] res 0 print("yes") print "yes" print("no") print "no" A = list(map(int, input().split())) list(map(int, input().split())) A n = int(input()) int(input()) n res = [False] [False] res sumA = sum(A) sum(A) sumA q = int(input()) int(input()) q def f(A, s, res):
  if res[0]:
    return
  if s == 0:
    res[0] = True
    return
  for i, a in enumerate(A):
    if a > s:
      break
    f(A[i+1:], s-a, res) def f(A, s, res):
  if res[0]:
    return
  if s == 0:
    res[0] = True
    return
  for i, a in enumerate(A):
    if a > s:
      break
    f(A[i+1:], s-a, res) f m = list(map(int, input().split())) list(map(int, input().split())) m
n = int(input())
A = list(map(int, input().split()))
A.sort()
sumA = sum(A)

q = int(input())
m = list(map(int, input().split()))

def f(A, s, res):
  if res[0]:
    return
  if s == 0:
    res[0] = True
    return
  for i, a in enumerate(A):
    if a > s:
      break
    f(A[i+1:], s-a, res)

for mi in m:
  res = [False]

  if mi <= sumA:
    f(A, mi, res)

  if res[0]:
    print("yes")
  else:
    print("no")