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

s = [list(map(int,bin(x)[2:].zfill(n))) for x in range(2**n)]

anset=set()
for j in s:
    ans=0
    for k in range(n):
        ans+=a[k]*j[k]
    anset.add(ans)

for i in range(q):
    if m[i] in anset:
        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 list(map(int,bin(x)[2:].zfill(n))) for x in range(2**n) for x in range(2**n) x range(2**n) range 2**n 2 n for x in range(2**n) list(map(int,bin(x)[2:].zfill(n))) list map(int,bin(x)[2:].zfill(n)) map int bin(x)[2:].zfill(n) [2:].zfill [2:] (x) bin x 2: 2 zfill n s = [list(map(int,bin(x)[2:].zfill(n))) for x in range(2**n)] s [list(map(int,bin(x)[2:].zfill(n))) for x in range(2**n)] anset=set() anset set() set for j in s:
    ans=0
    for k in range(n):
        ans+=a[k]*j[k]
    anset.add(ans) j s ans=0 ans 0 for k in range(n):
        ans+=a[k]*j[k]
     k range(n) range n ans+=a[k]*j[k] ans a[k]*j[k] a[k] a k j[k] j k anset.add(ans) anset.add anset add ans for i in range(q):
    if m[i] in anset:
        print('yes')
    else:
        print('no') i range(q) range q if m[i] in anset:
        print('yes')
    else:
        print('no') m[i] in anset m[i] m i anset print('yes') print 'yes' print('no') print 'no' m = list(map(int,input().split())) list(map(int,input().split())) m ans=0 0 ans ans+=a[k]*j[k] a[k]*j[k] ans a = list(map(int,input().split())) list(map(int,input().split())) a n = int(input()) int(input()) n anset=set() set() anset s = [list(map(int,bin(x)[2:].zfill(n))) for x in range(2**n)] [list(map(int,bin(x)[2:].zfill(n))) for x in range(2**n)] s q = int(input()) int(input()) q
n = int(input())
a = list(map(int,input().split()))
q = int(input())
m = list(map(int,input().split()))

s = [list(map(int,bin(x)[2:].zfill(n))) for x in range(2**n)]

anset=set()
for j in s:
    ans=0
    for k in range(n):
        ans+=a[k]*j[k]
    anset.add(ans)

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

