#include <stdio.h>

#define N 2000
#define Q 200

int solve(int, int, int *, int);

int main(){
  int A[N], n, q, i, B[Q];

  scanf("%d", &n);
  for(i = 0; i < n; i++){
    scanf("%d", &A[i]);
  }

  scanf("%d", &q);
  for(i = 0; i < q; i++){
    scanf("%d", &B[i]);
  }

  for(i = 0; i < q; i++){
    if(solve(0, B[i], A, n) == 1) printf("yes\n");
    else printf("no\n");
  }
  return 0;
}

int solve(int i, int m, int *A, int n){
  int res;

  if(m == 0){
    return 1;
  }

  if(i >= n){
    return 0;
  }

  res = solve(i + 1, m, A, n) || solve(i + 1, m - A[i], A, n);

  return res;
}