n = int(input())
a = [int(i) for i in input().split()]
q = int(input())
m = [int(i) for i in input().split()]

ok = [[0 for i in range(2001)] for j in range(21)]
ok[0][0] = 1

for i in range(n):
    for j in range(2001):
        if j+a[i] > 2000:
            ok[i+1][j] = max(ok[i][j], ok[i+1][j])
        else:
            ok[i+1][j] = max(ok[i][j], ok[i+1][j])
            ok[i+1][j+a[i]] = max(ok[i][j], ok[i+1][j+a[i]])

for i in m:
    print('yes' if ok[n][i] else 'no') n = int(input()) n int(input()) int input() input int(i) for i in input().split() for i in input().split() i input().split() ().split () input split for i in input().split() int(i) int i a = [int(i) for i in input().split()] a [int(i) for i in input().split()] q = int(input()) q int(input()) int input() input int(i) for i in input().split() for i in input().split() i input().split() ().split () input split for i in input().split() int(i) int i m = [int(i) for i in input().split()] m [int(i) for i in input().split()] [0 for i in range(2001)] for j in range(21) for j in range(21) j range(21) range 21 for j in range(21) [0 for i in range(2001)] ok = [[0 for i in range(2001)] for j in range(21)] ok [[0 for i in range(2001)] for j in range(21)] ok[0][0] = 1 ok[0][0] [0] ok 0 0 1 for i in range(n):
    for j in range(2001):
        if j+a[i] > 2000:
            ok[i+1][j] = max(ok[i][j], ok[i+1][j])
        else:
            ok[i+1][j] = max(ok[i][j], ok[i+1][j])
            ok[i+1][j+a[i]] = max(ok[i][j], ok[i+1][j+a[i]]) i range(n) range n for j in range(2001):
        if j+a[i] > 2000:
            ok[i+1][j] = max(ok[i][j], ok[i+1][j])
        else:
            ok[i+1][j] = max(ok[i][j], ok[i+1][j])
            ok[i+1][j+a[i]] = max(ok[i][j], ok[i+1][j+a[i]]) j range(2001) range 2001 if j+a[i] > 2000:
            ok[i+1][j] = max(ok[i][j], ok[i+1][j])
        else:
            ok[i+1][j] = max(ok[i][j], ok[i+1][j])
            ok[i+1][j+a[i]] = max(ok[i][j], ok[i+1][j+a[i]]) j+a[i] > 2000 j+a[i] j a[i] a i 2000 ok[i+1][j] = max(ok[i][j], ok[i+1][j]) ok[i+1][j] [i+1] ok i+1 i 1 j max(ok[i][j], ok[i+1][j]) max ok[i][j] [i] ok i j ok[i+1][j] [i+1] ok i+1 i 1 j ok[i+1][j] = max(ok[i][j], ok[i+1][j]) ok[i+1][j] [i+1] ok i+1 i 1 j max(ok[i][j], ok[i+1][j]) max ok[i][j] [i] ok i j ok[i+1][j] [i+1] ok i+1 i 1 j ok[i+1][j+a[i]] = max(ok[i][j], ok[i+1][j+a[i]]) ok[i+1][j+a[i]] [i+1] ok i+1 i 1 j+a[i] j a[i] a i max(ok[i][j], ok[i+1][j+a[i]]) max ok[i][j] [i] ok i j ok[i+1][j+a[i]] [i+1] ok i+1 i 1 j+a[i] j a[i] a i for i in m:
    print('yes' if ok[n][i] else 'no') i m print('yes' if ok[n][i] else 'no') print 'yes' if ok[n][i] else 'no' ok[n][i] [n] ok n i 'yes' 'no' n = int(input()) int(input()) n ok = [[0 for i in range(2001)] for j in range(21)] [[0 for i in range(2001)] for j in range(21)] ok q = int(input()) int(input()) q m = [int(i) for i in input().split()] [int(i) for i in input().split()] m a = [int(i) for i in input().split()] [int(i) for i in input().split()] a
n = int(input())
a = [int(i) for i in input().split()]
q = int(input())
m = [int(i) for i in input().split()]

ok = [[0 for i in range(2001)] for j in range(21)]
ok[0][0] = 1

for i in range(n):
    for j in range(2001):
        if j+a[i] > 2000:
            ok[i+1][j] = max(ok[i][j], ok[i+1][j])
        else:
            ok[i+1][j] = max(ok[i][j], ok[i+1][j])
            ok[i+1][j+a[i]] = max(ok[i][j], ok[i+1][j+a[i]])

for i in m:
    print('yes' if ok[n][i] else 'no')
