# coding=utf-8

def solve(i, m):
    global A
    if m == 0:
        return True
    elif i == n:
        return False
    else:
        return (solve(i+1, m) or solve(i+1, m-A[i]))

n = int(input())
A = tuple(map(int, input().split()))
q = int(input())
M = tuple(map(int, input().split()))
sum_A = sum(A)

for m in M:
    if m > sum_A:
        print('no')
    elif solve(0, m):
        print('yes')
    else:
        print('no') def solve(i, m):
    global A
    if m == 0:
        return True
    elif i == n:
        return False
    else:
        return (solve(i+1, m) or solve(i+1, m-A[i])) solve global A if m == 0:
        return True
    elif i == n:
        return False
    else:
        return (solve(i+1, m) or solve(i+1, m-A[i])) m == 0 m 0 return True True elif i == n:
        return False
     i == n i n return False False return (solve(i+1, m) or solve(i+1, m-A[i])) 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 i i m m n = int(input()) n int(input()) int input() input A = tuple(map(int, input().split())) A tuple(map(int, input().split())) tuple map(int, input().split()) map int input().split() ().split () input split q = int(input()) q int(input()) int input() input M = tuple(map(int, input().split())) M tuple(map(int, input().split())) tuple map(int, input().split()) map int input().split() ().split () input split sum_A = sum(A) sum_A sum(A) sum A for m in M:
    if m > sum_A:
        print('no')
    elif solve(0, m):
        print('yes')
    else:
        print('no') m M if m > sum_A:
        print('no')
    elif solve(0, m):
        print('yes')
    else:
        print('no') m > sum_A m sum_A print('no') print 'no' elif solve(0, m):
        print('yes')
     solve(0, m) solve 0 m print('yes') print 'yes' print('no') print 'no' def solve(i, m):
    global A
    if m == 0:
        return True
    elif i == n:
        return False
    else:
        return (solve(i+1, m) or solve(i+1, m-A[i])) def solve(i, m):
    global A
    if m == 0:
        return True
    elif i == n:
        return False
    else:
        return (solve(i+1, m) or solve(i+1, m-A[i])) solve q = int(input()) int(input()) q A = tuple(map(int, input().split())) tuple(map(int, input().split())) A M = tuple(map(int, input().split())) tuple(map(int, input().split())) M sum_A = sum(A) sum(A) sum_A n = int(input()) int(input()) n
# coding=utf-8

def solve(i, m):
    global A
    if m == 0:
        return True
    elif i == n:
        return False
    else:
        return (solve(i+1, m) or solve(i+1, m-A[i]))

n = int(input())
A = tuple(map(int, input().split()))
q = int(input())
M = tuple(map(int, input().split()))
sum_A = sum(A)

for m in M:
    if m > sum_A:
        print('no')
    elif solve(0, m):
        print('yes')
    else:
        print('no')