class ExhaustiveSeach
  def initialize
    @n = gets.to_i
    @a = gets.split.map(&:to_i)
  end

  def solve(i, m)
    return true if m == 0
    return false if i >= @n
    res = solve(i+1, m) || solve(i+1, m-@a[i])
    return res
  end
end

e = ExhaustiveSeach.new
q = gets.to_i
m = gets.split.map(&:to_i)

m.each do |mm|
  puts e.solve(0, mm) ? 'yes' : 'no'
end