N = int(input())
A = list(map(int, input().split()))
Q = int(input())
M = list(map(int, input().split()))

combinations = {}

def create_combinations(idx, sum):
    combinations[sum] = 1
    if idx >= N:
        return
    create_combinations(idx+1, sum)
    create_combinations(idx+1, sum+A[idx])
    return

create_combinations(0, 0)

for target in M:
    if target in combinations.keys():
        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 combinations = {} combinations {} def create_combinations(idx, sum):
    combinations[sum] = 1
    if idx >= N:
        return
    create_combinations(idx+1, sum)
    create_combinations(idx+1, sum+A[idx])
    return create_combinations combinations[sum] = 1 combinations[sum] combinations sum 1 if idx >= N:
        return
     idx >= N idx N return create_combinations(idx+1, sum) create_combinations idx+1 idx 1 sum create_combinations(idx+1, sum+A[idx]) create_combinations idx+1 idx 1 sum+A[idx] sum A[idx] A idx return idx idx sum sum create_combinations(0, 0) create_combinations 0 0 for target in M:
    if target in combinations.keys():
        print("yes")
    else:
        print("no") target M if target in combinations.keys():
        print("yes")
    else:
        print("no") target in combinations.keys() target combinations.keys() combinations.keys combinations keys print("yes") print "yes" print("no") print "no" Q = int(input()) int(input()) Q N = int(input()) int(input()) N M = list(map(int, input().split())) list(map(int, input().split())) M combinations = {} {} combinations def create_combinations(idx, sum):
    combinations[sum] = 1
    if idx >= N:
        return
    create_combinations(idx+1, sum)
    create_combinations(idx+1, sum+A[idx])
    return def create_combinations(idx, sum):
    combinations[sum] = 1
    if idx >= N:
        return
    create_combinations(idx+1, sum)
    create_combinations(idx+1, sum+A[idx])
    return create_combinations A = list(map(int, input().split())) list(map(int, input().split())) A
N = int(input())
A = list(map(int, input().split()))
Q = int(input())
M = list(map(int, input().split()))

combinations = {}

def create_combinations(idx, sum):
    combinations[sum] = 1
    if idx >= N:
        return
    create_combinations(idx+1, sum)
    create_combinations(idx+1, sum+A[idx])
    return

create_combinations(0, 0)

for target in M:
    if target in combinations.keys():
        print("yes")
    else:
        print("no")
