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