n = int(input())
A = [int(i) for i in input().split()]
input()
M = [int(i) for i in input().split()]

def solve(i, m):
    if m == 0:
        return True
    if i >= n or m < 0:
        return False
    res = solve(i+1, m) or solve(i+1, m-A[i])
    return res

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

def solve(i, m):
    if m == 0:
        return True
    if i >= n or m < 0:
        return False
    res = solve(i+1, m) or solve(i+1, m-A[i])
    return res

for m in M:
    if sum(A) < m:
        print("no")
    elif solve(0, m):
        print('yes')
    else:
        print('no')
