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

void make(int *);
void rec(int *,int);
int Search(int *,int);

int *A,*m;
int n,q;
int *jdg;
int main() {
  int i;
  int *S;

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

  scanf("%d",&q);
  m = (int *)malloc(q * sizeof(int));
   jdg = (int *)malloc(q * sizeof(int));
  for(i=0;i<q;i++) {
    scanf("%d",&m[i]);
    jdg[i] = 0;
  }
  S = (int *)malloc(n * sizeof(int));
  make(S);
  //for(i=0;i<n;i++) printf("%d ",S[i]);
  //make(S,n);
  //for(i=0;i<n;i++) printf("%d ",S[i]);
  
  for(i=0;i<q;i++) {
    if(jdg[i] == 1) printf("yes\n");
    else printf("no\n");
  }
  return 0;
}

void make(int *S) {
  int i,j;
  for(i=0;i<n;i++) {
    for(j=0;j<q;j++) {
      S[i] = 0;
    }
  }
  rec(S,0); 
}

void rec(int *S,int i) {
  int j=0;
  int judge=0;
  if(i==n) {
    //for(int i=0;i<n;i++) printf("%d ",S[i]);
    //printf("%d\n",q);
    for(j=0;j<q;j++) {
      judge = Search(S,m[j]);
      if(judge == 1) jdg[j] = 1;
    }
    //printf("\n");
    return;
  }

  rec(S,i+1);
  *(S+i) = 1;
  
  rec(S,i+1);
  *(S+i) = 0;
  
}

int Search(int *S,int key) {
  int i,j=0;
  int sum=0;
  //for(int i=0;i<n;i++) printf("%d ",S[i]);
  //printf("\n");
  for(i=0;i<n;i++) {
    if(S[i] == 1) {
      sum+=A[i];
    }
    if(sum == key) return 1;
  }
  return -1;
}


