n = input()

A = map(int, raw_input().split())
   
q = input()
   
M = map(int, raw_input().split())
  
def solve(i, m):
  if m == 0:
    return True
  if i >= n or m > sum(A):
    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 def solve(i, m):
  if m == 0:
    return True
  if i >= n or m > sum(A):
    return False
  res = solve(i+1, m) or solve(i+1, m - A[i])
  return res
  
   solve if m == 0:
    return True
   m == 0 m 0 return True True if i >= n or m > sum(A):
    return False
   i >= n or m > sum(A) i >= n i n m > sum(A) m sum(A) sum A 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 n = input() input() n q = input() input() q def solve(i, m):
  if m == 0:
    return True
  if i >= n or m > sum(A):
    return False
  res = solve(i+1, m) or solve(i+1, m - A[i])
  return res
  
   def solve(i, m):
  if m == 0:
    return True
  if i >= n or m > sum(A):
    return False
  res = solve(i+1, m) or solve(i+1, m - A[i])
  return res
  
   solve A = map(int, raw_input().split()) map(int, raw_input().split()) A M = map(int, raw_input().split()) map(int, raw_input().split()) M
n = input()

A = map(int, raw_input().split())
   
q = input()
   
M = map(int, raw_input().split())
  
def solve(i, m):
  if m == 0:
    return True
  if i >= n or m > sum(A):
    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"