n = input()
A = map(int, raw_input().split())
q = input()
M = map(int, raw_input().split())

min = min(A)
sum = sum(A)

def solve(i,m):
  if sum < m:
    return False
  if m == 0:
    return True
  if i >= n:
    return False
  res = solve(i+1,m) or solve(i+1, m - A[i])
  return res
 
for m in M:
    if solve(0, m):
      print 'yes'
    else:
      print 'no'
  n = input() n input() input A = map(int, raw_input().split()) A map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split q = input() q input() input M = map(int, raw_input().split()) M map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split min = min(A) min min(A) min A sum = sum(A) sum sum(A) sum A def solve(i,m):
  if sum < m:
    return False
  if m == 0:
    return True
  if i >= n:
    return False
  res = solve(i+1,m) or solve(i+1, m - A[i])
  return res
  solve if sum < m:
    return False
   sum < m sum m return False False if m == 0:
    return True
   m == 0 m 0 return True True if i >= n:
    return False
   i >= n i n return False False res = solve(i+1,m) or solve(i+1, m - A[i]) res solve(i+1,m) or solve(i+1, m - A[i]) solve(i+1,m) solve i+1 i 1 m solve(i+1, m - A[i]) solve i+1 i 1 m - A[i] m A[i] A i return res res i i m m for m in M:
    if solve(0, m):
      print 'yes'
    else:
      print 'no'
  m M if solve(0, m):
      print 'yes'
    else:
      print 'no'
  solve(0, m) solve 0 m print print sum = sum(A) sum(A) sum def solve(i,m):
  if sum < m:
    return False
  if m == 0:
    return True
  if i >= n:
    return False
  res = solve(i+1,m) or solve(i+1, m - A[i])
  return res
  def solve(i,m):
  if sum < m:
    return False
  if m == 0:
    return True
  if i >= n:
    return False
  res = solve(i+1,m) or solve(i+1, m - A[i])
  return res
  solve n = input() input() n q = input() input() q M = map(int, raw_input().split()) map(int, raw_input().split()) M A = map(int, raw_input().split()) map(int, raw_input().split()) A min = min(A) min(A) min
n = input()
A = map(int, raw_input().split())
q = input()
M = map(int, raw_input().split())

min = min(A)
sum = sum(A)

def solve(i,m):
  if sum < m:
    return False
  if m == 0:
    return True
  if i >= n:
    return False
  res = solve(i+1,m) or solve(i+1, m - A[i])
  return res
 
for m in M:
    if solve(0, m):
      print 'yes'
    else:
      print 'no'
 