n = int(raw_input())
A = map(int, raw_input().split())
q = int(raw_input())
m = map(int, raw_input().split())

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

def solve(i, m):
    if m == 0:
        return 1
    if i >= n or m > sum(A):
        return 0
    res = solve(i + 1, m) or solve(i + 1, m - A[i])
    return res
        
for j in range(0, q):
    if solve(0, m[j]):
        print "yes"
    else:
        print "no"