array_O = Array.new()
n = gets.chomp.to_i
array_A = gets.split(" ").map{|x|x.to_i}
q = gets.chomp.to_i
array_M = gets.split(" ").map{|x|x.to_i}
1.upto(n) { |i|
array_A.combination(i) {|arr|array_O.push(arr.inject {|sum, s| sum + s } )}
array_O.uniq!
}
q.times {|i|
if(array_O.include?(array_M[i]))
  print "yes"
else
  print "no"  
end
printf("\n")
}