import sys
import itertools
# import numpy as np
import time
import math
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))

can_make = [False] * 2001
for bit in range(2 ** n):
    total = 0
    for i in range(n):
        if bit & 1 << i > 0:
            total += A[i]
    if total <= 2000:
        can_make[total] = True

for m in M:
    if can_make[m]:
        print("yes")
    else:
        print("no")


 import sys sys import itertools itertools import time time import math math sys.setrecursionlimit(10 ** 7) sys.setrecursionlimit sys setrecursionlimit 10 ** 7 10 7 from collections import defaultdict read = sys.stdin.buffer.read read sys.stdin.buffer.read sys.stdin.buffer sys.stdin sys stdin buffer read readline = sys.stdin.buffer.readline readline sys.stdin.buffer.readline sys.stdin.buffer sys.stdin sys stdin buffer readline readlines = sys.stdin.buffer.readlines readlines sys.stdin.buffer.readlines sys.stdin.buffer sys.stdin sys stdin buffer readlines 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 can_make = [False] * 2001 can_make [False] * 2001 [False] False 2001 for bit in range(2 ** n):
    total = 0
    for i in range(n):
        if bit & 1 << i > 0:
            total += A[i]
    if total <= 2000:
        can_make[total] = True bit range(2 ** n) range 2 ** n 2 n total = 0 total 0 for i in range(n):
        if bit & 1 << i > 0:
            total += A[i]
     i range(n) range n if bit & 1 << i > 0:
            total += A[i]
     bit & 1 << i > 0 bit & 1 << i bit 1 << i 1 i 0 total += A[i] total A[i] A i if total <= 2000:
        can_make[total] = True total <= 2000 total 2000 can_make[total] = True can_make[total] can_make total True for m in M:
    if can_make[m]:
        print("yes")
    else:
        print("no") m M if can_make[m]:
        print("yes")
    else:
        print("no") can_make[m] can_make m print("yes") print "yes" print("no") print "no" M = list(map(int, input().split())) list(map(int, input().split())) M readlines = sys.stdin.buffer.readlines sys.stdin.buffer.readlines readlines total = 0 0 total read = sys.stdin.buffer.read sys.stdin.buffer.read read can_make = [False] * 2001 [False] * 2001 can_make n = int(input()) int(input()) n total += A[i] A[i] total A = list(map(int, input().split())) list(map(int, input().split())) A q = int(input()) int(input()) q readline = sys.stdin.buffer.readline sys.stdin.buffer.readline readline
import sys
import itertools
# import numpy as np
import time
import math
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n = int(input())
A = list(map(int, input().split()))
q = int(input())
M = list(map(int, input().split()))

can_make = [False] * 2001
for bit in range(2 ** n):
    total = 0
    for i in range(n):
        if bit & 1 << i > 0:
            total += A[i]
    if total <= 2000:
        can_make[total] = True

for m in M:
    if can_make[m]:
        print("yes")
    else:
        print("no")



