#include <stdio.h>
int solve(int ,int);

int A[20],n;
int main() {
  int i,j,q,m[200],t;
  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[i]);
  }
  for (i = 0; i < q; i++) {
    for (j = 0; j < n; j++) {
  t= solve(j,m[i]);
  if (t ==1) {
    printf("yes\n");
    break;
  }
}
  if (t ==0) {
    printf("no\n");
  }

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