#include<stdio.h>
#include<stdlib.h>


int size;
#define OK 1
#define NG 0


/*size???????????\?????????????????§???????????????????????????????????£?????????????????§???????????§?????????????????????????????±?????????*/
void s_sort(int *S){
  int i,j,k,swap,count;
  if(size>=10){
    for(i=size-1;i>size-5;i--){
      j=0;
      while(j<=size-5){
        k=i;
        while(k>=j){
          if(S[k] < S[k-4]){
            swap=S[k];
            S[k]=S[k-4];
            S[k]=swap;
            count+=1;
          }
          k-=4;
        }
        j+=4;    
      }
    }
  }
  for(i=0;i<size-1;i++){
    count=0;
    for(j=size-1;j>i;j--){
      if(S[j] <S[j-1]){
        swap=S[j];
        S[j]=S[j-1];
        S[j-1]=swap;
        count+=1;
      }
    }
    if(count==0) break;
  }
}


/*??????S???k?????????S[?????????]?????\????????°?????????????????????????????????????????????????????????????????¢??°*/
int judge(int *S,int k,int x){
  if(x==0) return OK;
  if(x < S[k]) return NG;
  else if(k==size){
    if(S[k]==x) return OK;
    else return NG;
  }
  if(judge(S,k+1,x-S[k]) +judge(S,k+1,x)) return OK;
  else return NG;
}




int main(){
  int i,*S,m,x;
  scanf("%d",&size);
  S=malloc(size*sizeof(int));
  for(i=0;i<size;i++) scanf("%d",&S[i]);
  s_sort(S);
  for(i=0;i<size;i++) printf("%d\n",S[i]);
  scanf("%d",&m);
  for(i=0;i<m;i++){
    scanf("%d",&x);
    if(judge(S,0,x)) printf("yes\n");
    else printf("no\n");
  }
  return 0;
}
  