def f():
    return int(raw_input())
def f2():
    return map(int, raw_input().split())

def f3(n, AA, x):
    tmp = n + AA[0]
    if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        f3(n, AA[1:], x)
        try:
            x[tmp] = 1
            f3(tmp, AA[1:],x)
        except:
            pass
    return

n = f()
A = sorted(f2())
q = f()
M = f2()

x = [0 for i in range(max(M)+1)]
f3(0, A, x)

for e in M:
    if x[e] == 1:
        print 'yes'
    else:
        print 'no' def f():
    return int(raw_input()) f return int(raw_input()) int(raw_input()) int raw_input() raw_input def f2():
    return map(int, raw_input().split()) f2 return map(int, raw_input().split()) map(int, raw_input().split()) map int raw_input().split() ().split () raw_input split def f3(n, AA, x):
    tmp = n + AA[0]
    if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        f3(n, AA[1:], x)
        try:
            x[tmp] = 1
            f3(tmp, AA[1:],x)
        except:
            pass
    return f3 tmp = n + AA[0] tmp n + AA[0] n AA[0] AA 0 if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        f3(n, AA[1:], x)
        try:
            x[tmp] = 1
            f3(tmp, AA[1:],x)
        except:
            pass
     len(AA) == 1 len(AA) len AA 1 try: x[tmp] = 1
        except: pass
     except: pass
     f3(n, AA[1:], x) f3 n AA[1:] AA 1: 1 x try:
            x[tmp] = 1
            f3(tmp, AA[1:],x)
        except:
            pass
     except:
            pass
     x[tmp] = 1 x[tmp] x tmp 1 f3(tmp, AA[1:],x) f3 tmp AA[1:] AA 1: 1 x return n n AA AA x x n = f() n f() f A = sorted(f2()) A sorted(f2()) sorted f2() f2 q = f() q f() f M = f2() M f2() f2 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)] f3(0, A, x) f3 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 def f3(n, AA, x):
    tmp = n + AA[0]
    if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        f3(n, AA[1:], x)
        try:
            x[tmp] = 1
            f3(tmp, AA[1:],x)
        except:
            pass
    return def f3(n, AA, x):
    tmp = n + AA[0]
    if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        f3(n, AA[1:], x)
        try:
            x[tmp] = 1
            f3(tmp, AA[1:],x)
        except:
            pass
    return f3 A = sorted(f2()) sorted(f2()) A x = [0 for i in range(max(M)+1)] [0 for i in range(max(M)+1)] x q = f() f() q M = f2() f2() M def f2():
    return map(int, raw_input().split()) def f2():
    return map(int, raw_input().split()) f2 def f():
    return int(raw_input()) def f():
    return int(raw_input()) f n = f() f() n
def f():
    return int(raw_input())
def f2():
    return map(int, raw_input().split())

def f3(n, AA, x):
    tmp = n + AA[0]
    if len(AA) == 1:
        try: x[tmp] = 1
        except: pass
    else:
        f3(n, AA[1:], x)
        try:
            x[tmp] = 1
            f3(tmp, AA[1:],x)
        except:
            pass
    return

n = f()
A = sorted(f2())
q = f()
M = f2()

x = [0 for i in range(max(M)+1)]
f3(0, A, x)

for e in M:
    if x[e] == 1:
        print 'yes'
    else:
        print 'no'