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

memo = []
for i in range(len(A)+1):
    memo.append([None]*2000)

def solve(i,m):
    if memo[i][m] != None: return memo[i][m]
    if m == 0:
        memo[i][m] = True
        return True
    elif i >= n:
        memo[i][m] = False
        return False
    else:
        ret = solve(i+1,m) | solve(i+1,m-A[i])
        memo[i][m] = ret
        return ret

for m in M:
    if solve(0,m): print "yes"
    else: print "no" n = int(raw_input()) n int(raw_input()) int raw_input() raw_input A = map(int, raw_input().strip().split(' ')) A map(int, raw_input().strip().split(' ')) map int raw_input().strip().split(' ') ().strip().split ().strip() ().strip () raw_input strip split ' ' q = int(raw_input()) q int(raw_input()) int raw_input() raw_input M = map(int, raw_input().strip().split(' ')) M map(int, raw_input().strip().split(' ')) map int raw_input().strip().split(' ') ().strip().split ().strip() ().strip () raw_input strip split ' ' memo = [] memo [] for i in range(len(A)+1):
    memo.append([None]*2000) i range(len(A)+1) range len(A)+1 len(A) len A 1 memo.append([None]*2000) memo.append memo append [None]*2000 [None] None 2000 def solve(i,m):
    if memo[i][m] != None: return memo[i][m]
    if m == 0:
        memo[i][m] = True
        return True
    elif i >= n:
        memo[i][m] = False
        return False
    else:
        ret = solve(i+1,m) | solve(i+1,m-A[i])
        memo[i][m] = ret
        return ret solve if memo[i][m] != None: return memo[i][m]
     memo[i][m] != None memo[i][m] [i] memo i m None if m == 0:
        memo[i][m] = True
        return True
    elif i >= n:
        memo[i][m] = False
        return False
    else:
        ret = solve(i+1,m) | solve(i+1,m-A[i])
        memo[i][m] = ret
        return ret m == 0 m 0 memo[i][m] = True memo[i][m] [i] memo i m True return True True elif i >= n:
        memo[i][m] = False
        return False
     i >= n i n memo[i][m] = False memo[i][m] [i] memo i m False return False False ret = solve(i+1,m) | solve(i+1,m-A[i]) ret solve(i+1,m) | 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 memo[i][m] = ret memo[i][m] [i] memo i m ret return ret ret 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 n = int(raw_input()) int(raw_input()) n q = int(raw_input()) int(raw_input()) q memo = [] [] memo def solve(i,m):
    if memo[i][m] != None: return memo[i][m]
    if m == 0:
        memo[i][m] = True
        return True
    elif i >= n:
        memo[i][m] = False
        return False
    else:
        ret = solve(i+1,m) | solve(i+1,m-A[i])
        memo[i][m] = ret
        return ret def solve(i,m):
    if memo[i][m] != None: return memo[i][m]
    if m == 0:
        memo[i][m] = True
        return True
    elif i >= n:
        memo[i][m] = False
        return False
    else:
        ret = solve(i+1,m) | solve(i+1,m-A[i])
        memo[i][m] = ret
        return ret solve M = map(int, raw_input().strip().split(' ')) map(int, raw_input().strip().split(' ')) M A = map(int, raw_input().strip().split(' ')) map(int, raw_input().strip().split(' ')) A
n = int(raw_input())
A = map(int, raw_input().strip().split(' '))
q = int(raw_input())
M = map(int, raw_input().strip().split(' '))

memo = []
for i in range(len(A)+1):
    memo.append([None]*2000)

def solve(i,m):
    if memo[i][m] != None: return memo[i][m]
    if m == 0:
        memo[i][m] = True
        return True
    elif i >= n:
        memo[i][m] = False
        return False
    else:
        ret = solve(i+1,m) | solve(i+1,m-A[i])
        memo[i][m] = ret
        return ret

for m in M:
    if solve(0,m): print "yes"
    else: print "no"