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

ans = set()
for i in range(2**n):
    total = 0
    bits = bin(i)[2:].zfill(n)
    for j, b in enumerate(bits):
        if b == '1':
            total += A[j]
    ans.add(total)

for i in range(q):
    if M[i] in ans:
        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 ans = set() ans set() set for i in range(2**n):
    total = 0
    bits = bin(i)[2:].zfill(n)
    for j, b in enumerate(bits):
        if b == '1':
            total += A[j]
    ans.add(total) i range(2**n) range 2**n 2 n total = 0 total 0 bits = bin(i)[2:].zfill(n) bits bin(i)[2:].zfill(n) [2:].zfill [2:] (i) bin i 2: 2 zfill n for j, b in enumerate(bits):
        if b == '1':
            total += A[j]
     j b enumerate(bits) enumerate bits if b == '1':
            total += A[j]
     b == '1' b '1' total += A[j] total A[j] A j ans.add(total) ans.add ans add total for i in range(q):
    if M[i] in ans:
        print('yes')
    else:
        print('no') i range(q) range q if M[i] in ans:
        print('yes')
    else:
        print('no') M[i] in ans M[i] M i ans print('yes') print 'yes' print('no') print 'no' q = int(input()) int(input()) q n = int(input()) int(input()) n A = list(map(int, input().split())) list(map(int, input().split())) A total = 0 0 total bits = bin(i)[2:].zfill(n) bin(i)[2:].zfill(n) bits ans = set() set() ans M = list(map(int, input().split())) list(map(int, input().split())) M total += A[j] A[j] total
n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))

ans = set()
for i in range(2**n):
    total = 0
    bits = bin(i)[2:].zfill(n)
    for j, b in enumerate(bits):
        if b == '1':
            total += A[j]
    ans.add(total)

for i in range(q):
    if M[i] in ans:
        print('yes')
    else:
        print('no')

