n = int(input())
A = tuple(map(int,input().split()))
q = int(input())
Q = tuple(map(int, input().split()))
dp = [0]*(2**n)

for i in range(n):
    for j in range(1<<i):
        dp[j+(1<<i)] = dp[j] + A[i]

s = set(dp)
for n in Q:
    print("yes" if set([n]) & s else "no") n = int(input()) n int(input()) int input() input A = tuple(map(int,input().split())) A tuple(map(int,input().split())) tuple map(int,input().split()) map int input().split() ().split () input split q = int(input()) q int(input()) int input() input Q = tuple(map(int, input().split())) Q tuple(map(int, input().split())) tuple map(int, input().split()) map int input().split() ().split () input split dp = [0]*(2**n) dp [0]*(2**n) [0] 0 2**n 2 n for i in range(n):
    for j in range(1<<i):
        dp[j+(1<<i)] = dp[j] + A[i] i range(n) range n for j in range(1<<i):
        dp[j+(1<<i)] = dp[j] + A[i] j range(1<<i) range 1<<i 1 i dp[j+(1<<i)] = dp[j] + A[i] dp[j+(1<<i)] dp j+(1<<i) j 1<<i 1 i dp[j] + A[i] dp[j] dp j A[i] A i s = set(dp) s set(dp) set dp for n in Q:
    print("yes" if set([n]) & s else "no") n Q print("yes" if set([n]) & s else "no") print "yes" if set([n]) & s else "no" set([n]) & s set([n]) set [n] n s "yes" "no" dp = [0]*(2**n) [0]*(2**n) dp s = set(dp) set(dp) s Q = tuple(map(int, input().split())) tuple(map(int, input().split())) Q n = int(input()) int(input()) n q = int(input()) int(input()) q A = tuple(map(int,input().split())) tuple(map(int,input().split())) A
n = int(input())
A = tuple(map(int,input().split()))
q = int(input())
Q = tuple(map(int, input().split()))
dp = [0]*(2**n)

for i in range(n):
    for j in range(1<<i):
        dp[j+(1<<i)] = dp[j] + A[i]

s = set(dp)
for n in Q:
    print("yes" if set([n]) & s else "no")