#include<stdio.h>
#define N 20
#define Q 2000

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

/*
How to test
% diff <(./a.out < b1in.txt) <(cat b1out.txt) 

  for( i=0 ; i < n ; i++){
    fprintf(stderr, "%d: C2[%d] = %c%c \n" ,__LINE__ ,i ,C2[i].suit ,C2[i].value );
  }

 */
int main(){
  int i,j;
  int res;
  int nmax;
  int n[N];
  int qmax;
  int q[Q];

  scanf("%d", &nmax);
  for ( i = 0; i < nmax; i++ ) scanf("%d", &n[i]);
  scanf("%d", &qmax);
  for ( i = 0; i < qmax; i++ ) scanf("%d", &q[i]);

  for( i =0 ; i < qmax ; i++){
    res = solve(0, q[i], n, nmax);
    if(res == -1 ){
      printf("yes\n");
    }else{
      printf("no\n");
    }
  }


  return 0; // Don't forget return 0
}

int solve(int i, int m, int* a_p, int n ){
  int res, r1 ,r2;

  if( m == 0){
    return -1; // true
  }
  if( i >= n){
    return -2; // false
  }

  //fprintf(stderr, "%d: i=%d m=%d n=%d a_p[i]=%d " ,__LINE__ ,i ,m ,n ,a_p[i]);
  r1 = solve(i+1, m,          a_p, n);
  r2 = solve(i+1, m - a_p[i], a_p, n);
  if(r1 == -1 || r2 == -1 ){
    res = -1;
  }else{
    res = -2;
  }

  return res;
}