n = int(input())
a = list(map(int, input().split()))
# count on j
# 最初に入力したリスト

q = int(input())
m = list(map(int, input().split()))
# count on i
# 後に入力したリスト


def solve(i, m_count):
    if m_count == 0:
        return True
    if i >= n:
        return False
    res = solve(i + 1, m_count) or solve(i + 1, m_count - a[i])
    return res


for count in m:
    if sum(a) < count:
        print("no")
    elif solve(0, count):
        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 solve(i, m_count):
    if m_count == 0:
        return True
    if i >= n:
        return False
    res = solve(i + 1, m_count) or solve(i + 1, m_count - a[i])
    return res solve if m_count == 0:
        return True
     m_count == 0 m_count 0 return True True if i >= n:
        return False
     i >= n i n return False False res = solve(i + 1, m_count) or solve(i + 1, m_count - a[i]) res solve(i + 1, m_count) or solve(i + 1, m_count - a[i]) solve(i + 1, m_count) solve i + 1 i 1 m_count solve(i + 1, m_count - a[i]) solve i + 1 i 1 m_count - a[i] m_count a[i] a i return res res i i m_count m_count for count in m:
    if sum(a) < count:
        print("no")
    elif solve(0, count):
        print("yes")
    else:
        print("no") count m if sum(a) < count:
        print("no")
    elif solve(0, count):
        print("yes")
    else:
        print("no") sum(a) < count sum(a) sum a count print("no") print "no" elif solve(0, count):
        print("yes")
     solve(0, count) solve 0 count print("yes") print "yes" print("no") print "no" def solve(i, m_count):
    if m_count == 0:
        return True
    if i >= n:
        return False
    res = solve(i + 1, m_count) or solve(i + 1, m_count - a[i])
    return res def solve(i, m_count):
    if m_count == 0:
        return True
    if i >= n:
        return False
    res = solve(i + 1, m_count) or solve(i + 1, m_count - a[i])
    return res solve n = int(input()) int(input()) n q = int(input()) int(input()) q m = list(map(int, input().split())) list(map(int, input().split())) m a = list(map(int, input().split())) list(map(int, input().split())) a
n = int(input())
a = list(map(int, input().split()))
# count on j
# 最初に入力したリスト

q = int(input())
m = list(map(int, input().split()))
# count on i
# 後に入力したリスト


def solve(i, m_count):
    if m_count == 0:
        return True
    if i >= n:
        return False
    res = solve(i + 1, m_count) or solve(i + 1, m_count - a[i])
    return res


for count in m:
    if sum(a) < count:
        print("no")
    elif solve(0, count):
        print("yes")
    else:
        print("no")

