N = int(input())
A = list(map(int,input().split()))
M = int(input())
Q = list(map(int,input().split()))
SL = []
for bit in range(1<<N):
    SUM = 0
    for i in range(N):
        if bit & (1<<i):
            SUM += A[i]
    SL.append(SUM)
for q in Q:
    if q in SL:
        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 M = int(input()) M int(input()) int input() input Q = list(map(int,input().split())) Q list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split SL = [] SL [] for bit in range(1<<N):
    SUM = 0
    for i in range(N):
        if bit & (1<<i):
            SUM += A[i]
    SL.append(SUM) bit range(1<<N) range 1<<N 1 N SUM = 0 SUM 0 for i in range(N):
        if bit & (1<<i):
            SUM += A[i]
     i range(N) range N if bit & (1<<i):
            SUM += A[i]
     bit & (1<<i) bit 1<<i 1 i SUM += A[i] SUM A[i] A i SL.append(SUM) SL.append SL append SUM for q in Q:
    if q in SL:
        print('yes')
    else:
        print('no') q Q if q in SL:
        print('yes')
    else:
        print('no') q in SL q SL print('yes') print 'yes' print('no') print 'no' SUM += A[i] A[i] SUM SUM = 0 0 SUM N = int(input()) int(input()) N SL = [] [] SL A = list(map(int,input().split())) list(map(int,input().split())) A M = int(input()) int(input()) M Q = list(map(int,input().split())) list(map(int,input().split())) Q
N = int(input())
A = list(map(int,input().split()))
M = int(input())
Q = list(map(int,input().split()))
SL = []
for bit in range(1<<N):
    SUM = 0
    for i in range(N):
        if bit & (1<<i):
            SUM += A[i]
    SL.append(SUM)
for q in Q:
    if q in SL:
        print('yes')
    else:
        print('no')
