def solve(A, i, m, n):
    """Return if it is possible to make value m with some elements in A.

    n is length of A.
    i is index.
    Using Divide-and-Conquer method.
    """

    if m == 0:
        return True
    if i >= n or m < 0:
        return False
    return solve(A, i + 1, m, n) or solve(A, i + 1, m - A[i], n)


import sys

n = int(sys.stdin.readline())
A = tuple(map(int, sys.stdin.readline().split()))
q = sys.stdin.readline()
M = tuple(map(int, sys.stdin.readline().split()))

s_A = sum(A)

ans = ''

for m in M:
    if s_A < m:
        ans += 'no\n'
    elif solve(A, 0, m, n):
        ans += 'yes\n'
    else:
        ans += 'no\n'

print(ans, end = '') def solve(A, i, m, n):
    """Return if it is possible to make value m with some elements in A.

    n is length of A.
    i is index.
    Using Divide-and-Conquer method.
    """

    if m == 0:
        return True
    if i >= n or m < 0:
        return False
    return solve(A, i + 1, m, n) or solve(A, i + 1, m - A[i], n) solve """Return if it is possible to make value m with some elements in A.

    n is length of A.
    i is index.
    Using Divide-and-Conquer method.
    """ if m == 0:
        return True
     m == 0 m 0 return True True if i >= n or m < 0:
        return False
     i >= n or m < 0 i >= n i n m < 0 m 0 return False False return solve(A, i + 1, m, n) or solve(A, i + 1, m - A[i], n) solve(A, i + 1, m, n) or solve(A, i + 1, m - A[i], n) solve(A, i + 1, m, n) solve A i + 1 i 1 m n solve(A, i + 1, m - A[i], n) solve A i + 1 i 1 m - A[i] m A[i] A i n A A i i m m n n import sys sys n = int(sys.stdin.readline()) n int(sys.stdin.readline()) int sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline A = tuple(map(int, sys.stdin.readline().split())) A tuple(map(int, sys.stdin.readline().split())) tuple map(int, sys.stdin.readline().split()) map int sys.stdin.readline().split() sys.stdin.readline().split sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline split q = sys.stdin.readline() q sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline M = tuple(map(int, sys.stdin.readline().split())) M tuple(map(int, sys.stdin.readline().split())) tuple map(int, sys.stdin.readline().split()) map int sys.stdin.readline().split() sys.stdin.readline().split sys.stdin.readline() sys.stdin.readline sys.stdin sys stdin readline split s_A = sum(A) s_A sum(A) sum A ans = '' ans '' for m in M:
    if s_A < m:
        ans += 'no\n'
    elif solve(A, 0, m, n):
        ans += 'yes\n'
    else:
        ans += 'no\n' m M if s_A < m:
        ans += 'no\n'
    elif solve(A, 0, m, n):
        ans += 'yes\n'
    else:
        ans += 'no\n' s_A < m s_A m ans += 'no\n' ans 'no\n' elif solve(A, 0, m, n):
        ans += 'yes\n'
     solve(A, 0, m, n) solve A 0 m n ans += 'yes\n' ans 'yes\n' ans += 'no\n' ans 'no\n' print(ans, end = '') print ans end = '' end '' def solve(A, i, m, n):
    """Return if it is possible to make value m with some elements in A.

    n is length of A.
    i is index.
    Using Divide-and-Conquer method.
    """

    if m == 0:
        return True
    if i >= n or m < 0:
        return False
    return solve(A, i + 1, m, n) or solve(A, i + 1, m - A[i], n) def solve(A, i, m, n):
    """Return if it is possible to make value m with some elements in A.

    n is length of A.
    i is index.
    Using Divide-and-Conquer method.
    """

    if m == 0:
        return True
    if i >= n or m < 0:
        return False
    return solve(A, i + 1, m, n) or solve(A, i + 1, m - A[i], n) solve A = tuple(map(int, sys.stdin.readline().split())) tuple(map(int, sys.stdin.readline().split())) A s_A = sum(A) sum(A) s_A ans += 'no\n' 'no\n' ans q = sys.stdin.readline() sys.stdin.readline() q ans = '' '' ans n = int(sys.stdin.readline()) int(sys.stdin.readline()) n ans += 'no\n' 'no\n' ans ans += 'yes\n' 'yes\n' ans M = tuple(map(int, sys.stdin.readline().split())) tuple(map(int, sys.stdin.readline().split())) M
def solve(A, i, m, n):
    """Return if it is possible to make value m with some elements in A.

    n is length of A.
    i is index.
    Using Divide-and-Conquer method.
    """

    if m == 0:
        return True
    if i >= n or m < 0:
        return False
    return solve(A, i + 1, m, n) or solve(A, i + 1, m - A[i], n)


import sys

n = int(sys.stdin.readline())
A = tuple(map(int, sys.stdin.readline().split()))
q = sys.stdin.readline()
M = tuple(map(int, sys.stdin.readline().split()))

s_A = sum(A)

ans = ''

for m in M:
    if s_A < m:
        ans += 'no\n'
    elif solve(A, 0, m, n):
        ans += 'yes\n'
    else:
        ans += 'no\n'

print(ans, end = '')