n = int(input())
A = list(map(int,input().split()))
q = int(input())
m = list(map(int,input().split()))
sumA = sum(A)
def solve(i,m):
    if m == 0:
        return 1
    if i >= n:
        return 0
    rec =  solve(i+1,m) or solve(i+1, m - A[i])
    return rec
for i in m:
    if i >= sumA:
        print("no")
    else:
        if solve(0,i):
            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 sumA = sum(A) sumA sum(A) sum A def solve(i,m):
    if m == 0:
        return 1
    if i >= n:
        return 0
    rec =  solve(i+1,m) or solve(i+1, m - A[i])
    return rec solve if m == 0:
        return 1
     m == 0 m 0 return 1 1 if i >= n:
        return 0
     i >= n i n return 0 0 rec =  solve(i+1,m) or solve(i+1, m - A[i]) rec solve(i+1,m) or solve(i+1, m - A[i]) solve(i+1,m) solve i+1 i 1 m solve(i+1, m - A[i]) solve i+1 i 1 m - A[i] m A[i] A i return rec rec i i m m for i in m:
    if i >= sumA:
        print("no")
    else:
        if solve(0,i):
            print("yes")
        else:
            print("no") i m if i >= sumA:
        print("no")
    else:
        if solve(0,i):
            print("yes")
        else:
            print("no") i >= sumA i sumA print("no") print "no" if solve(0,i):
            print("yes")
        else:
            print("no") solve(0,i) solve 0 i print("yes") print "yes" print("no") print "no" def solve(i,m):
    if m == 0:
        return 1
    if i >= n:
        return 0
    rec =  solve(i+1,m) or solve(i+1, m - A[i])
    return rec def solve(i,m):
    if m == 0:
        return 1
    if i >= n:
        return 0
    rec =  solve(i+1,m) or solve(i+1, m - A[i])
    return rec solve n = int(input()) int(input()) n A = list(map(int,input().split())) list(map(int,input().split())) A sumA = sum(A) sum(A) sumA q = int(input()) int(input()) q m = list(map(int,input().split())) list(map(int,input().split())) m
n = int(input())
A = list(map(int,input().split()))
q = int(input())
m = list(map(int,input().split()))
sumA = sum(A)
def solve(i,m):
    if m == 0:
        return 1
    if i >= n:
        return 0
    rec =  solve(i+1,m) or solve(i+1, m - A[i])
    return rec
for i in m:
    if i >= sumA:
        print("no")
    else:
        if solve(0,i):
            print("yes")
        else:
            print("no")
