# get n  list_n
n = int(input())
list_n = [int(x) for x in input().split(' ')]

# get q list_q
q = int(input())
list_q = [int(x) for x in input().split(' ')]

#define recursion find_partial_sum
#input: integer list and M
#output boolean

def find_partial_sum(idx, M):
    if 0 > M or idx >= n:
        return False
    i = list_n[idx]
    if M == i:
        return True
    if find_partial_sum(idx+1, M-i) or find_partial_sum(idx+1, M):
        return True
    return False
#iterate q and check find_åparcial_sum(list_n, q_i) and print
for q_i in list_q:
    if sum(list_n) < q_i:
        print("no")
    elif find_partial_sum(0, q_i):
        print('yes')
    else:
        print('no') n = int(input()) n int(input()) int input() input int(x) for x in input().split(' ') for x in input().split(' ') x input().split(' ') ().split () input split ' ' for x in input().split(' ') int(x) int x list_n = [int(x) for x in input().split(' ')] list_n [int(x) for x in input().split(' ')] q = int(input()) q int(input()) int input() input int(x) for x in input().split(' ') for x in input().split(' ') x input().split(' ') ().split () input split ' ' for x in input().split(' ') int(x) int x list_q = [int(x) for x in input().split(' ')] list_q [int(x) for x in input().split(' ')] def find_partial_sum(idx, M):
    if 0 > M or idx >= n:
        return False
    i = list_n[idx]
    if M == i:
        return True
    if find_partial_sum(idx+1, M-i) or find_partial_sum(idx+1, M):
        return True
    return False
#iterate q and check find_åparcial_sum(list_n, q_i) and print find_partial_sum if 0 > M or idx >= n:
        return False
     0 > M or idx >= n 0 > M 0 M idx >= n idx n return False False i = list_n[idx] i list_n[idx] list_n idx if M == i:
        return True
     M == i M i return True True if find_partial_sum(idx+1, M-i) or find_partial_sum(idx+1, M):
        return True
     find_partial_sum(idx+1, M-i) or find_partial_sum(idx+1, M) find_partial_sum(idx+1, M-i) find_partial_sum idx+1 idx 1 M-i M i find_partial_sum(idx+1, M) find_partial_sum idx+1 idx 1 M return True True return False False idx idx M M for q_i in list_q:
    if sum(list_n) < q_i:
        print("no")
    elif find_partial_sum(0, q_i):
        print('yes')
    else:
        print('no') q_i list_q if sum(list_n) < q_i:
        print("no")
    elif find_partial_sum(0, q_i):
        print('yes')
    else:
        print('no') sum(list_n) < q_i sum(list_n) sum list_n q_i print("no") print "no" elif find_partial_sum(0, q_i):
        print('yes')
     find_partial_sum(0, q_i) find_partial_sum 0 q_i print('yes') print 'yes' print('no') print 'no' list_n = [int(x) for x in input().split(' ')] [int(x) for x in input().split(' ')] list_n list_q = [int(x) for x in input().split(' ')] [int(x) for x in input().split(' ')] list_q def find_partial_sum(idx, M):
    if 0 > M or idx >= n:
        return False
    i = list_n[idx]
    if M == i:
        return True
    if find_partial_sum(idx+1, M-i) or find_partial_sum(idx+1, M):
        return True
    return False
#iterate q and check find_åparcial_sum(list_n, q_i) and print def find_partial_sum(idx, M):
    if 0 > M or idx >= n:
        return False
    i = list_n[idx]
    if M == i:
        return True
    if find_partial_sum(idx+1, M-i) or find_partial_sum(idx+1, M):
        return True
    return False
#iterate q and check find_åparcial_sum(list_n, q_i) and print find_partial_sum n = int(input()) int(input()) n q = int(input()) int(input()) q
# get n  list_n
n = int(input())
list_n = [int(x) for x in input().split(' ')]

# get q list_q
q = int(input())
list_q = [int(x) for x in input().split(' ')]

#define recursion find_partial_sum
#input: integer list and M
#output boolean

def find_partial_sum(idx, M):
    if 0 > M or idx >= n:
        return False
    i = list_n[idx]
    if M == i:
        return True
    if find_partial_sum(idx+1, M-i) or find_partial_sum(idx+1, M):
        return True
    return False
#iterate q and check find_åparcial_sum(list_n, q_i) and print
for q_i in list_q:
    if sum(list_n) < q_i:
        print("no")
    elif find_partial_sum(0, q_i):
        print('yes')
    else:
        print('no')
