#include <stdio.h>

#define N 32
#define Q 256
#define TRUE 1
#define FALSE 0

int n, A[N] = {0};

int solve(int i, int m) {
  int res;
  
  if (m == 0)
    return TRUE;
  if (n <= i)
    return FALSE;
  res = solve(i + 1, m) || solve(i + 1, m - A[i]);
  return res;
}

int main(void) {
  int i, q, m;

  scanf("%d", &n);
  for (i = 0; i < n; i++)
    scanf("%d", &A[i]);
  scanf("%d", &q);
  for (i = 0; i < q; i++) {
    scanf("%d", &m);
    if (solve(0, m) == TRUE)
      printf("yes\n");
    else
      printf("no\n");
  }
  
  return 0;
}