n = int(input())
a = list(map(int,input().split()))
q = int(input())
m = list(map(int,input().split()))

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 m_tmp in m:
    if sum(a) < m_tmp:
        print('no')
    elif solve(0,m_tmp):
        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 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 m_tmp in m:
    if sum(a) < m_tmp:
        print('no')
    elif solve(0,m_tmp):
        print('yes')
    else:
        print('no') m_tmp m if sum(a) < m_tmp:
        print('no')
    elif solve(0,m_tmp):
        print('yes')
    else:
        print('no') sum(a) < m_tmp sum(a) sum a m_tmp print('no') print 'no' elif solve(0,m_tmp):
        print('yes')
     solve(0,m_tmp) solve 0 m_tmp print('yes') print 'yes' print('no') print 'no' n = int(input()) int(input()) n 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 a = list(map(int,input().split())) list(map(int,input().split())) a q = int(input()) int(input()) q
n = int(input())
a = list(map(int,input().split()))
q = int(input())
m = list(map(int,input().split()))

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 m_tmp in m:
    if sum(a) < m_tmp:
        print('no')
    elif solve(0,m_tmp):
        print('yes')
    else:
        print('no')