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