import std.algorithm;
import std.array;
import std.container;
import std.conv;
import std.range;
import std.stdio;
import std.string;

bool solve(int[] p, int t) {
  if (p.empty) return t == 0;
  if (t == 0) return true;
  if (t < 0) return false;
  int n = p.front;
  p.popFront;
  if (solve(p, t-n)) return true;
  if (solve(p, t)) return true;
  return false;
}

void main() {
  auto n = readln.chomp.to!int;
  auto a = readln.chomp.split.map!(to!int).array;
  auto q = readln.chomp.to!int;
  auto m = readln.chomp.split.map!(to!int).array;

  foreach (m_i; m) {
    if (solve(a, m_i)) {
      "yes".writeln;
    } else {
      "no".writeln;
    }
  }
}