#include<stdio.h>

int n, A[20];

int solve(int i, int m);

int main(){
  int q,m[200],i,judge,j;

  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++){
      
      judge =  solve(j,m[i]);
      
      if(judge == 1){
	printf("yes\n");
	break;
      }
    }
    if (judge != 1)printf("no\n");
  }
  
  return 0;
}

int solve(int i, int m){
  int res;
  if(m == 0){
    return 1;
  }
  if(i >= n){
    return 0;
  }

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

 
  return res;
}