n = int(raw_input())
A = map(int, raw_input().strip().split(' '))
q = int(raw_input())
M = map(int, raw_input().strip().split(' '))


S = [0]*len(A)
flags = [False]*len(M)
def brute_force(n):
    if n == len(S):
        ans = 0
        for i in range(len(S)):
            if S[i] == 1: ans += A[i]
        for i in range(len(M)):
            if ans == M[i]: flags[i] = True
    else:
        S[n] = 0
        brute_force(n+1)
        S[n] = 1
        brute_force(n+1)


brute_force(0)

for flag in flags:
    if flag: print "yes"
    else: print "no" n = int(raw_input()) n int(raw_input()) int raw_input() raw_input A = map(int, raw_input().strip().split(' ')) A map(int, raw_input().strip().split(' ')) map int raw_input().strip().split(' ') ().strip().split ().strip() ().strip () raw_input strip split ' ' q = int(raw_input()) q int(raw_input()) int raw_input() raw_input M = map(int, raw_input().strip().split(' ')) M map(int, raw_input().strip().split(' ')) map int raw_input().strip().split(' ') ().strip().split ().strip() ().strip () raw_input strip split ' ' S = [0]*len(A) S [0]*len(A) [0] 0 len(A) len A flags = [False]*len(M) flags [False]*len(M) [False] False len(M) len M def brute_force(n):
    if n == len(S):
        ans = 0
        for i in range(len(S)):
            if S[i] == 1: ans += A[i]
        for i in range(len(M)):
            if ans == M[i]: flags[i] = True
    else:
        S[n] = 0
        brute_force(n+1)
        S[n] = 1
        brute_force(n+1) brute_force if n == len(S):
        ans = 0
        for i in range(len(S)):
            if S[i] == 1: ans += A[i]
        for i in range(len(M)):
            if ans == M[i]: flags[i] = True
    else:
        S[n] = 0
        brute_force(n+1)
        S[n] = 1
        brute_force(n+1) n == len(S) n len(S) len S ans = 0 ans 0 for i in range(len(S)):
            if S[i] == 1: ans += A[i]
         i range(len(S)) range len(S) len S if S[i] == 1: ans += A[i]
         S[i] == 1 S[i] S i 1 for i in range(len(M)):
            if ans == M[i]: flags[i] = True
     i range(len(M)) range len(M) len M if ans == M[i]: flags[i] = True
     ans == M[i] ans M[i] M i S[n] = 0 S[n] S n 0 brute_force(n+1) brute_force n+1 n 1 S[n] = 1 S[n] S n 1 brute_force(n+1) brute_force n+1 n 1 n n brute_force(0) brute_force 0 for flag in flags:
    if flag: print "yes"
    else: print "no" flag flags if flag: print "yes"
    else: print "no" flag q = int(raw_input()) int(raw_input()) q n = int(raw_input()) int(raw_input()) n A = map(int, raw_input().strip().split(' ')) map(int, raw_input().strip().split(' ')) A flags = [False]*len(M) [False]*len(M) flags def brute_force(n):
    if n == len(S):
        ans = 0
        for i in range(len(S)):
            if S[i] == 1: ans += A[i]
        for i in range(len(M)):
            if ans == M[i]: flags[i] = True
    else:
        S[n] = 0
        brute_force(n+1)
        S[n] = 1
        brute_force(n+1) def brute_force(n):
    if n == len(S):
        ans = 0
        for i in range(len(S)):
            if S[i] == 1: ans += A[i]
        for i in range(len(M)):
            if ans == M[i]: flags[i] = True
    else:
        S[n] = 0
        brute_force(n+1)
        S[n] = 1
        brute_force(n+1) brute_force S = [0]*len(A) [0]*len(A) S M = map(int, raw_input().strip().split(' ')) map(int, raw_input().strip().split(' ')) M
n = int(raw_input())
A = map(int, raw_input().strip().split(' '))
q = int(raw_input())
M = map(int, raw_input().strip().split(' '))


S = [0]*len(A)
flags = [False]*len(M)
def brute_force(n):
    if n == len(S):
        ans = 0
        for i in range(len(S)):
            if S[i] == 1: ans += A[i]
        for i in range(len(M)):
            if ans == M[i]: flags[i] = True
    else:
        S[n] = 0
        brute_force(n+1)
        S[n] = 1
        brute_force(n+1)


brute_force(0)

for flag in flags:
    if flag: print "yes"
    else: print "no"