def solve(m, A):
    if A[0] == m: return True
    if len(A)==1: return False
    if m < A[0] : return solve(m, A[1:])
    if solve(m-A[0], A[1:]):
        return True
    return solve(m, A[1:])

if __name__=='__main__':
    n=int(input()) 
    A=list(map(int,input().split()))
    q=int(input()) 
    Q=list(map(int,input().split()))
    for m in Q:
        if   m > sum(A): print('no')
        elif solve(m,A): print('yes') 
        else           : print('no')  def solve(m, A):
    if A[0] == m: return True
    if len(A)==1: return False
    if m < A[0] : return solve(m, A[1:])
    if solve(m-A[0], A[1:]):
        return True
    return solve(m, A[1:]) solve if A[0] == m: return True
     A[0] == m A[0] A 0 m if len(A)==1: return False
     len(A)==1 len(A) len A 1 if m < A[0] : return solve(m, A[1:])
     m < A[0] m A[0] A 0 if solve(m-A[0], A[1:]):
        return True
     solve(m-A[0], A[1:]) solve m-A[0] m A[0] A 0 A[1:] A 1: 1 return True True return solve(m, A[1:]) solve(m, A[1:]) solve m A[1:] A 1: 1 m m A A if __name__=='__main__':
    n=int(input()) 
    A=list(map(int,input().split()))
    q=int(input()) 
    Q=list(map(int,input().split()))
    for m in Q:
        if   m > sum(A): print('no')
        elif solve(m,A): print('yes') 
        else           : print('no')  __name__=='__main__' __name__ '__main__' 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 Q=list(map(int,input().split())) Q list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split for m in Q:
        if   m > sum(A): print('no')
        elif solve(m,A): print('yes') 
        else           : print('no')  m Q if   m > sum(A): print('no')
        elif solve(m,A): print('yes') 
        else           : print('no')  m > sum(A) m sum(A) sum A elif solve(m,A): print('yes') 
         solve(m,A) solve m A n=int(input()) int(input()) n q=int(input()) int(input()) q Q=list(map(int,input().split())) list(map(int,input().split())) Q def solve(m, A):
    if A[0] == m: return True
    if len(A)==1: return False
    if m < A[0] : return solve(m, A[1:])
    if solve(m-A[0], A[1:]):
        return True
    return solve(m, A[1:]) def solve(m, A):
    if A[0] == m: return True
    if len(A)==1: return False
    if m < A[0] : return solve(m, A[1:])
    if solve(m-A[0], A[1:]):
        return True
    return solve(m, A[1:]) solve A=list(map(int,input().split())) list(map(int,input().split())) A
def solve(m, A):
    if A[0] == m: return True
    if len(A)==1: return False
    if m < A[0] : return solve(m, A[1:])
    if solve(m-A[0], A[1:]):
        return True
    return solve(m, A[1:])

if __name__=='__main__':
    n=int(input()) 
    A=list(map(int,input().split()))
    q=int(input()) 
    Q=list(map(int,input().split()))
    for m in Q:
        if   m > sum(A): print('no')
        elif solve(m,A): print('yes') 
        else           : print('no') 