n = int(input())
a = list(map(int,input().split()))
q = int(input())
m = list(map(int,input().split()))
"""def dfs(i,m):
    global a
    if i == 0:
        if m == 0:
            return True
        else:
            return False
    if dfs(i-1, m):
        return True
    if dfs(i-1,m - a[i-1]): 
        return True
    return False
for i in range(q):
    if dfs(n,m[i]):
        print("yes")
    else:
        print("no")"""
b = []
def dfs(i,m):
    global b
    if i == 0:
        b.append(m)
    else:
        dfs(i-1,m)
        dfs(i-1,m+a[i-1])
    return b
b = dfs(n,0)
for i in range(q):
    if m[i] in b:
        print("yes")
    else:
        print("no") 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 """def dfs(i,m):
    global a
    if i == 0:
        if m == 0:
            return True
        else:
            return False
    if dfs(i-1, m):
        return True
    if dfs(i-1,m - a[i-1]): 
        return True
    return False
for i in range(q):
    if dfs(n,m[i]):
        print("yes")
    else:
        print("no")""" b = [] b [] def dfs(i,m):
    global b
    if i == 0:
        b.append(m)
    else:
        dfs(i-1,m)
        dfs(i-1,m+a[i-1])
    return b dfs global b if i == 0:
        b.append(m)
    else:
        dfs(i-1,m)
        dfs(i-1,m+a[i-1])
     i == 0 i 0 b.append(m) b.append b append m dfs(i-1,m) dfs i-1 i 1 m dfs(i-1,m+a[i-1]) dfs i-1 i 1 m+a[i-1] m a[i-1] a i-1 i 1 return b b i i m m b = dfs(n,0) b dfs(n,0) dfs n 0 for i in range(q):
    if m[i] in b:
        print("yes")
    else:
        print("no") i range(q) range q if m[i] in b:
        print("yes")
    else:
        print("no") m[i] in b m[i] m i b print("yes") print "yes" print("no") print "no" b = [] [] b q = int(input()) int(input()) q n = int(input()) int(input()) n a = list(map(int,input().split())) list(map(int,input().split())) a m = list(map(int,input().split())) list(map(int,input().split())) m def dfs(i,m):
    global b
    if i == 0:
        b.append(m)
    else:
        dfs(i-1,m)
        dfs(i-1,m+a[i-1])
    return b def dfs(i,m):
    global b
    if i == 0:
        b.append(m)
    else:
        dfs(i-1,m)
        dfs(i-1,m+a[i-1])
    return b dfs b = dfs(n,0) dfs(n,0) b
n = int(input())
a = list(map(int,input().split()))
q = int(input())
m = list(map(int,input().split()))
"""def dfs(i,m):
    global a
    if i == 0:
        if m == 0:
            return True
        else:
            return False
    if dfs(i-1, m):
        return True
    if dfs(i-1,m - a[i-1]): 
        return True
    return False
for i in range(q):
    if dfs(n,m[i]):
        print("yes")
    else:
        print("no")"""
b = []
def dfs(i,m):
    global b
    if i == 0:
        b.append(m)
    else:
        dfs(i-1,m)
        dfs(i-1,m+a[i-1])
    return b
b = dfs(n,0)
for i in range(q):
    if m[i] in b:
        print("yes")
    else:
        print("no")
