def ans(n, AA, x):
    tmp = n + AA[0]
    if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        ans(n, AA[1:], x)
        try:
            x[tmp] = 1
            ans(tmp, AA[1:],x)
        except:
            pass
    return
 
n = raw_input()
A = map(int, raw_input().split())
q = raw_input()
M = map(int, raw_input().split())
 
x = [0 for i in range(max(M)+1)]
ans(0, A, x)
 
for e in M:
    if x[e] == 1:
        print 'yes'
    else:
        print 'no' def ans(n, AA, x):
    tmp = n + AA[0]
    if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        ans(n, AA[1:], x)
        try:
            x[tmp] = 1
            ans(tmp, AA[1:],x)
        except:
            pass
    return
  ans tmp = n + AA[0] tmp n + AA[0] n AA[0] AA 0 if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        ans(n, AA[1:], x)
        try:
            x[tmp] = 1
            ans(tmp, AA[1:],x)
        except:
            pass
     len(AA) == 1 len(AA) len AA 1 try: x[tmp] = 1
        except: pass
     except: pass
     ans(n, AA[1:], x) ans n AA[1:] AA 1: 1 x try:
            x[tmp] = 1
            ans(tmp, AA[1:],x)
        except:
            pass
     except:
            pass
     x[tmp] = 1 x[tmp] x tmp 1 ans(tmp, AA[1:],x) ans tmp AA[1:] AA 1: 1 x return n n AA AA x x n = raw_input() n raw_input() raw_input A = map(int, raw_input().split()) A map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split q = raw_input() q raw_input() raw_input M = map(int, raw_input().split()) M map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split 0 for i in range(max(M)+1) for i in range(max(M)+1) i range(max(M)+1) range max(M)+1 max(M) max M 1 for i in range(max(M)+1) 0 x = [0 for i in range(max(M)+1)] x [0 for i in range(max(M)+1)] ans(0, A, x) ans 0 A x for e in M:
    if x[e] == 1:
        print 'yes'
    else:
        print 'no' e M if x[e] == 1:
        print 'yes'
    else:
        print 'no' x[e] == 1 x[e] x e 1 print print A = map(int, raw_input().split()) map(int, raw_input().split()) A def ans(n, AA, x):
    tmp = n + AA[0]
    if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        ans(n, AA[1:], x)
        try:
            x[tmp] = 1
            ans(tmp, AA[1:],x)
        except:
            pass
    return
  def ans(n, AA, x):
    tmp = n + AA[0]
    if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        ans(n, AA[1:], x)
        try:
            x[tmp] = 1
            ans(tmp, AA[1:],x)
        except:
            pass
    return
  ans q = raw_input() raw_input() q x = [0 for i in range(max(M)+1)] [0 for i in range(max(M)+1)] x n = raw_input() raw_input() n M = map(int, raw_input().split()) map(int, raw_input().split()) M
def ans(n, AA, x):
    tmp = n + AA[0]
    if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        ans(n, AA[1:], x)
        try:
            x[tmp] = 1
            ans(tmp, AA[1:],x)
        except:
            pass
    return
 
n = raw_input()
A = map(int, raw_input().split())
q = raw_input()
M = map(int, raw_input().split())
 
x = [0 for i in range(max(M)+1)]
ans(0, A, x)
 
for e in M:
    if x[e] == 1:
        print 'yes'
    else:
        print 'no'