n = int(input())
a = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))
minA = min(a)
sumA = 0
for i in a:
    sumA += i


def solve(i, m):
    if m==0 :
        return True
    if i>=n:
        return False
    res = solve(i+1, m) or solve(i+1, m-a[i])
    return res

for j in M:
    if j < minA or j > sumA:
        print('no')
    else:
        if solve(0, j):
            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 ' ' minA = min(a) minA min(a) min a sumA = 0 sumA 0 for i in a:
    sumA += i i a sumA += i sumA i def solve(i, m):
    if m==0 :
        return True
    if i>=n:
        return False
    res = solve(i+1, m) or solve(i+1, m-a[i])
    return res solve if m==0 :
        return True
     m==0 m 0 return True True if i>=n:
        return False
     i>=n i n return False False 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 M:
    if j < minA or j > sumA:
        print('no')
    else:
        if solve(0, j):
            print('yes')
        else:
            print('no') j M if j < minA or j > sumA:
        print('no')
    else:
        if solve(0, j):
            print('yes')
        else:
            print('no') j < minA or j > sumA j < minA j minA j > sumA j sumA print('no') print 'no' if solve(0, j):
            print('yes')
        else:
            print('no') solve(0, j) solve 0 j print('yes') print 'yes' print('no') print 'no' M = list(map(int, input().split(' '))) list(map(int, input().split(' '))) M def solve(i, m):
    if m==0 :
        return True
    if i>=n:
        return False
    res = solve(i+1, m) or solve(i+1, m-a[i])
    return res def solve(i, m):
    if m==0 :
        return True
    if i>=n:
        return False
    res = solve(i+1, m) or solve(i+1, m-a[i])
    return res solve sumA = 0 0 sumA n = int(input()) int(input()) n a = list(map(int, input().split(' '))) list(map(int, input().split(' '))) a minA = min(a) min(a) minA sumA += i i sumA q = int(input()) int(input()) q
n = int(input())
a = list(map(int, input().split(' ')))
q = int(input())
M = list(map(int, input().split(' ')))
minA = min(a)
sumA = 0
for i in a:
    sumA += i


def solve(i, m):
    if m==0 :
        return True
    if i>=n:
        return False
    res = solve(i+1, m) or solve(i+1, m-a[i])
    return res

for j in M:
    if j < minA or j > sumA:
        print('no')
    else:
        if solve(0, j):
            print('yes')
        else:
            print('no')

