n = gets.to_i
A = gets.split.map(&:to_i)
q = gets.to_i
M = gets.split.map(&:to_i)

=begin
# Exhaustive search
test0 = -> (i, m) do
  return true if m == 0
  return false if i == n
  test0.(i+1, m - A[i]) || test0.(i+1, m)
end
M.each do |m|
  puts(test0.(0, m) ? 'yes' : 'no')
end
=end

# DP
dp = Array.new(n+1){Hash.new(nil)}
test = -> (i, m) do
  if dp[i][m].nil?
    dp[i][m] = (if m == 0
      true
    elsif i == n
      false
    else
      test.(i+1, m - A[i]) || test.(i+1, m)
    end)
  else
    dp[i][m]
  end
end
M.each do |m|
  puts(test.(0, m) ? 'yes' : 'no')
end

