n = gets.to_i
a = gets.split.map(&:to_i)
q = gets.to_i
m = gets.split.map(&:to_i)
acomb = Array.new
for i in 1..n
  acomb.concat(a.combination(i).to_a)
end
require 'set'
s = Set.new
l = acomb.length
for i in 0...l
  li = acomb[i].length
  sum = 0
  for j in 0...li
    sum += acomb[i][j]
  end
  s << sum
end
for i in 0...q
  if s.include? m[i]
    puts "yes"
  else
    puts "no"
  end
end