n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(input().split())
for i in range(m):
    B[i] = int(B[i])

def solve(x,y):
    if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < 2001:
            solve(x+1,y+A[x])
            
S = [0 for i in range(2001)]

solve(0,0)
    
for i in range(m):
    if S[B[i]] == 1:
        print("yes")
    else:
        print("no")
 n = int(input()) n int(input()) int input() input A = list(map(int,input().split())) A list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split m = int(input()) m int(input()) int input() input B = list(input().split()) B list(input().split()) list input().split() ().split () input split for i in range(m):
    B[i] = int(B[i]) i range(m) range m B[i] = int(B[i]) B[i] B i int(B[i]) int B[i] B i def solve(x,y):
    if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < 2001:
            solve(x+1,y+A[x])
             solve if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < 2001:
            solve(x+1,y+A[x])
             x==n x n S[y] = 1 S[y] S y 1 solve(x+1,y) solve x+1 x 1 y if y+A[x] < 2001:
            solve(x+1,y+A[x])
             y+A[x] < 2001 y+A[x] y A[x] A x 2001 solve(x+1,y+A[x]) solve x+1 x 1 y+A[x] y A[x] A x x x y y 0 for i in range(2001) for i in range(2001) i range(2001) range 2001 for i in range(2001) 0 S = [0 for i in range(2001)] S [0 for i in range(2001)] solve(0,0) solve 0 0 for i in range(m):
    if S[B[i]] == 1:
        print("yes")
    else:
        print("no") i range(m) range m if S[B[i]] == 1:
        print("yes")
    else:
        print("no") S[B[i]] == 1 S[B[i]] S B[i] B i 1 print("yes") print "yes" print("no") print "no" B = list(input().split()) list(input().split()) B A = list(map(int,input().split())) list(map(int,input().split())) A n = int(input()) int(input()) n def solve(x,y):
    if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < 2001:
            solve(x+1,y+A[x])
             def solve(x,y):
    if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < 2001:
            solve(x+1,y+A[x])
             solve m = int(input()) int(input()) m S = [0 for i in range(2001)] [0 for i in range(2001)] S
n = int(input())
A = list(map(int,input().split()))
m = int(input())
B = list(input().split())
for i in range(m):
    B[i] = int(B[i])

def solve(x,y):
    if x==n:
        S[y] = 1
    else:
        solve(x+1,y)
        if y+A[x] < 2001:
            solve(x+1,y+A[x])
            
S = [0 for i in range(2001)]

solve(0,0)
    
for i in range(m):
    if S[B[i]] == 1:
        print("yes")
    else:
        print("no")

