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


u = set()

def agari(i):
    if X[i]==1:
        X[i]=0
        agari(i+1)
    else:
        X[i]=1

X = [0]*20
k=0
while k<(pow(2,n)-1):
    y = 0
    for l in range(n):
        y += A[l]*X[l]
    u.add(y)
    agari(0)
    k+=1

for j in range(q):
    if m[j] in u:
        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 u = set() u set() set def agari(i):
    if X[i]==1:
        X[i]=0
        agari(i+1)
    else:
        X[i]=1 agari if X[i]==1:
        X[i]=0
        agari(i+1)
    else:
        X[i]=1 X[i]==1 X[i] X i 1 X[i]=0 X[i] X i 0 agari(i+1) agari i+1 i 1 X[i]=1 X[i] X i 1 i i X = [0]*20 X [0]*20 [0] 0 20 k=0 k 0 while k<(pow(2,n)-1):
    y = 0
    for l in range(n):
        y += A[l]*X[l]
    u.add(y)
    agari(0)
    k+=1 k<(pow(2,n)-1) k pow(2,n)-1 pow(2,n) pow 2 n 1 y = 0 y 0 for l in range(n):
        y += A[l]*X[l]
     l range(n) range n y += A[l]*X[l] y A[l]*X[l] A[l] A l X[l] X l u.add(y) u.add u add y agari(0) agari 0 k+=1 k 1 for j in range(q):
    if m[j] in u:
        print("yes")
    else:
        print("no") j range(q) range q if m[j] in u:
        print("yes")
    else:
        print("no") m[j] in u m[j] m j u print("yes") print "yes" print("no") print "no" n = int(input()) int(input()) n m = list(map(int, input().split())) list(map(int, input().split())) m def agari(i):
    if X[i]==1:
        X[i]=0
        agari(i+1)
    else:
        X[i]=1 def agari(i):
    if X[i]==1:
        X[i]=0
        agari(i+1)
    else:
        X[i]=1 agari k=0 0 k u = set() set() u X = [0]*20 [0]*20 X q = int(input()) int(input()) q y = 0 0 y k+=1 1 k A = list(map(int, input().split())) list(map(int, input().split())) A y += A[l]*X[l] A[l]*X[l] y
n = int(input())
A = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))


u = set()

def agari(i):
    if X[i]==1:
        X[i]=0
        agari(i+1)
    else:
        X[i]=1

X = [0]*20
k=0
while k<(pow(2,n)-1):
    y = 0
    for l in range(n):
        y += A[l]*X[l]
    u.add(y)
    agari(0)
    k+=1

for j in range(q):
    if m[j] in u:
        print("yes")
    else:
        print("no")
