#include<stdio.h>

int A[20],N;
int solve(int,int);

int main(){

  int mi[200],M,i,count=0;

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

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

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


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

