#Exhaustive Search (bit全探索ver)
n = int(input())
A = list(map(int,input().split()))
q = int(input())
m = list(map(int,input().split()))

count_list = []
for i in range(1<<n):
    copy_A = A.copy()
    count = 0
    for j in range(n):
        mask = 1 << j
        if mask & i != 0:
            count += A[j]
    count_list.append(count)

for k in m:
    if k in count_list:
        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 count_list = [] count_list [] for i in range(1<<n):
    copy_A = A.copy()
    count = 0
    for j in range(n):
        mask = 1 << j
        if mask & i != 0:
            count += A[j]
    count_list.append(count) i range(1<<n) range 1<<n 1 n copy_A = A.copy() copy_A A.copy() A.copy A copy count = 0 count 0 for j in range(n):
        mask = 1 << j
        if mask & i != 0:
            count += A[j]
     j range(n) range n mask = 1 << j mask 1 << j 1 j if mask & i != 0:
            count += A[j]
     mask & i != 0 mask & i mask i 0 count += A[j] count A[j] A j count_list.append(count) count_list.append count_list append count for k in m:
    if k in count_list:
        print('yes')
    else:
        print('no')
     k m if k in count_list:
        print('yes')
    else:
        print('no')
     k in count_list k count_list print('yes') print 'yes' print('no') print 'no' copy_A = A.copy() A.copy() copy_A m = list(map(int,input().split())) list(map(int,input().split())) m count = 0 0 count q = int(input()) int(input()) q count += A[j] A[j] count mask = 1 << j 1 << j mask n = int(input()) int(input()) n A = list(map(int,input().split())) list(map(int,input().split())) A count_list = [] [] count_list
#Exhaustive Search (bit全探索ver)
n = int(input())
A = list(map(int,input().split()))
q = int(input())
m = list(map(int,input().split()))

count_list = []
for i in range(1<<n):
    copy_A = A.copy()
    count = 0
    for j in range(n):
        mask = 1 << j
        if mask & i != 0:
            count += A[j]
    count_list.append(count)

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