n = int(input())
(*a, ) = map(int, input().split())
q = int(input())
(*m, ) = map(int, input().split())
s = set()
for j in range(2 << n):
    c = 0
    for k in range(n):
        if j >> k & 1:
            c += a[k]
    s.add(c)

for i in m:
    print("yneos"[i not in s::2]) n = int(input()) n int(input()) int input() input (*a, ) = map(int, input().split()) *a a map(int, input().split()) map int input().split() ().split () input split q = int(input()) q int(input()) int input() input (*m, ) = map(int, input().split()) *m m map(int, input().split()) map int input().split() ().split () input split s = set() s set() set for j in range(2 << n):
    c = 0
    for k in range(n):
        if j >> k & 1:
            c += a[k]
    s.add(c) j range(2 << n) range 2 << n 2 n c = 0 c 0 for k in range(n):
        if j >> k & 1:
            c += a[k]
     k range(n) range n if j >> k & 1:
            c += a[k]
     j >> k & 1 j >> k j k 1 c += a[k] c a[k] a k s.add(c) s.add s add c for i in m:
    print("yneos"[i not in s::2]) i m print("yneos"[i not in s::2]) print "yneos"[i not in s::2] "yneos" i not in s::2 i not in s i s 2 c = 0 0 c s = set() set() s n = int(input()) int(input()) n c += a[k] a[k] c q = int(input()) int(input()) q
n = int(input())
(*a, ) = map(int, input().split())
q = int(input())
(*m, ) = map(int, input().split())
s = set()
for j in range(2 << n):
    c = 0
    for k in range(n):
        if j >> k & 1:
            c += a[k]
    s.add(c)

for i in m:
    print("yneos"[i not in s::2])
