_ = int(input())
hoge = [int(x) for x in input().split()]
_ = int(input())

def exSearch(i, m):
    if m == 0:
        return True
    if i >= len(hoge) or m > sum(hoge):
        return False
    res = exSearch(i+1, m) or exSearch(i+1, m-hoge[i])
    return res

if __name__ == '__main__':
    
    for val in (int(x) for x in input().split()):
        if exSearch(0, val):
            print ('yes')
        else:
            print ('no') _ = int(input()) _ int(input()) int input() input int(x) for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() int(x) int x hoge = [int(x) for x in input().split()] hoge [int(x) for x in input().split()] _ = int(input()) _ int(input()) int input() input def exSearch(i, m):
    if m == 0:
        return True
    if i >= len(hoge) or m > sum(hoge):
        return False
    res = exSearch(i+1, m) or exSearch(i+1, m-hoge[i])
    return res exSearch if m == 0:
        return True
     m == 0 m 0 return True True if i >= len(hoge) or m > sum(hoge):
        return False
     i >= len(hoge) or m > sum(hoge) i >= len(hoge) i len(hoge) len hoge m > sum(hoge) m sum(hoge) sum hoge return False False res = exSearch(i+1, m) or exSearch(i+1, m-hoge[i]) res exSearch(i+1, m) or exSearch(i+1, m-hoge[i]) exSearch(i+1, m) exSearch i+1 i 1 m exSearch(i+1, m-hoge[i]) exSearch i+1 i 1 m-hoge[i] m hoge[i] hoge i return res res i i m m if __name__ == '__main__':
    
    for val in (int(x) for x in input().split()):
        if exSearch(0, val):
            print ('yes')
        else:
            print ('no') __name__ == '__main__' __name__ '__main__' for val in (int(x) for x in input().split()):
        if exSearch(0, val):
            print ('yes')
        else:
            print ('no') val (int(x) for x in input().split()) if exSearch(0, val):
            print ('yes')
        else:
            print ('no') exSearch(0, val) exSearch 0 val print ('yes') print 'yes' print ('no') print 'no' _ = int(input()) int(input()) _ def exSearch(i, m):
    if m == 0:
        return True
    if i >= len(hoge) or m > sum(hoge):
        return False
    res = exSearch(i+1, m) or exSearch(i+1, m-hoge[i])
    return res def exSearch(i, m):
    if m == 0:
        return True
    if i >= len(hoge) or m > sum(hoge):
        return False
    res = exSearch(i+1, m) or exSearch(i+1, m-hoge[i])
    return res exSearch _ = int(input()) int(input()) _ hoge = [int(x) for x in input().split()] [int(x) for x in input().split()] hoge
_ = int(input())
hoge = [int(x) for x in input().split()]
_ = int(input())

def exSearch(i, m):
    if m == 0:
        return True
    if i >= len(hoge) or m > sum(hoge):
        return False
    res = exSearch(i+1, m) or exSearch(i+1, m-hoge[i])
    return res

if __name__ == '__main__':
    
    for val in (int(x) for x in input().split()):
        if exSearch(0, val):
            print ('yes')
        else:
            print ('no')
