n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))

# bit all search
pattern = []
for i in range(2 ** n):
    bit_set = []
    for j in range(n):
        if ((i >> j) & 1):
            bit_set.append(A[j])    
    pattern.append(sum(bit_set))

#print(pattern)  

for m in m:
    if m in pattern:
        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 q = int(input()) q int(input()) int input() input m = list(map(int, input().split())) m list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split pattern = [] pattern [] for i in range(2 ** n):
    bit_set = []
    for j in range(n):
        if ((i >> j) & 1):
            bit_set.append(A[j])    
    pattern.append(sum(bit_set))

#print(pattern)   i range(2 ** n) range 2 ** n 2 n bit_set = [] bit_set [] for j in range(n):
        if ((i >> j) & 1):
            bit_set.append(A[j])    
     j range(n) range n if ((i >> j) & 1):
            bit_set.append(A[j])    
     (i >> j) & 1 i >> j i j 1 bit_set.append(A[j]) bit_set.append bit_set append A[j] A j pattern.append(sum(bit_set)) pattern.append pattern append sum(bit_set) sum bit_set for m in m:
    if m in pattern:
        print('yes')
    else:
        print('no') m m if m in pattern:
        print('yes')
    else:
        print('no') m in pattern m pattern print('yes') print 'yes' print('no') print 'no' bit_set = [] [] bit_set n = int(input()) int(input()) n A = list(map(int, input().split())) list(map(int, input().split())) A q = int(input()) int(input()) q pattern = [] [] pattern m = list(map(int, input().split())) list(map(int, input().split())) m
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))

# bit all search
pattern = []
for i in range(2 ** n):
    bit_set = []
    for j in range(n):
        if ((i >> j) & 1):
            bit_set.append(A[j])    
    pattern.append(sum(bit_set))

#print(pattern)  

for m in m:
    if m in pattern:
        print('yes')
    else:
        print('no')

