
def solve(Mi,i):
    if Mi == 0: return True
    if i < n and min(A[i:]) <= Mi <= sum(A[i:]):
        r1 = solve(Mi-A[i],i+1)
        if r1: return r1
        r2 = solve(Mi,i+1)
        if r2: return r2
n = input()
A = map(int,raw_input().split())
q = input()
M = map(int,raw_input().split())
for Mi in M:
    print "yes" if solve(Mi,0) else "no" def solve(Mi,i):
    if Mi == 0: return True
    if i < n and min(A[i:]) <= Mi <= sum(A[i:]):
        r1 = solve(Mi-A[i],i+1)
        if r1: return r1
        r2 = solve(Mi,i+1)
        if r2: return r2 solve if Mi == 0: return True
     Mi == 0 Mi 0 if i < n and min(A[i:]) <= Mi <= sum(A[i:]):
        r1 = solve(Mi-A[i],i+1)
        if r1: return r1
        r2 = solve(Mi,i+1)
        if r2: return r2 i < n and min(A[i:]) <= Mi <= sum(A[i:]) i < n i n min(A[i:]) <= Mi <= sum(A[i:]) min(A[i:]) <= Mi min(A[i:]) min A[i:] A i: i Mi sum(A[i:]) sum A[i:] A i: i r1 = solve(Mi-A[i],i+1) r1 solve(Mi-A[i],i+1) solve Mi-A[i] Mi A[i] A i i+1 i 1 if r1: return r1
         r1 r2 = solve(Mi,i+1) r2 solve(Mi,i+1) solve Mi i+1 i 1 if r2: r r2 Mi Mi i i n = input() n input() input A = map(int,raw_input().split()) A map(int,raw_input().split()) map int raw_input().split() ().split () raw_input split q = input() q input() input M = map(int,raw_input().split()) M map(int,raw_input().split()) map int raw_input().split() ().split () raw_input split for Mi in M:
    print "yes" if solve(Mi,0) else "no" Mi M print "yes" if solve(Mi,0) else "no" solve(Mi,0) solve Mi 0 "yes" "no" M = map(int,raw_input().split()) map(int,raw_input().split()) M n = input() input() n q = input() input() q def solve(Mi,i):
    if Mi == 0: return True
    if i < n and min(A[i:]) <= Mi <= sum(A[i:]):
        r1 = solve(Mi-A[i],i+1)
        if r1: return r1
        r2 = solve(Mi,i+1)
        if r2: return r2 def solve(Mi,i):
    if Mi == 0: return True
    if i < n and min(A[i:]) <= Mi <= sum(A[i:]):
        r1 = solve(Mi-A[i],i+1)
        if r1: return r1
        r2 = solve(Mi,i+1)
        if r2: return r2 solve A = map(int,raw_input().split()) map(int,raw_input().split()) A

def solve(Mi,i):
    if Mi == 0: return True
    if i < n and min(A[i:]) <= Mi <= sum(A[i:]):
        r1 = solve(Mi-A[i],i+1)
        if r1: return r1
        r2 = solve(Mi,i+1)
        if r2: return r2
n = input()
A = map(int,raw_input().split())
q = input()
M = map(int,raw_input().split())
for Mi in M:
    print "yes" if solve(Mi,0) else "no"