n = gets.chomp.to_i
a = gets.chomp.split.map(&:to_i)
q = gets.chomp.to_i
m = gets.chomp.split.map(&:to_i)

sums = []
[0,1].repeated_permutation(n) do |arr|
  sum = 0
  n.times do |i|
    sum += arr[i]*a[i]
  end
  sums.push sum
end

sums.sort!.uniq!

m.each do |t|
  if sums.bsearch{|s| s >= t} == t
    puts 'yes'
  else
    puts 'no'
  end
end

