#include <stdio.h>
#include <stdlib.h>
#define N 2000

int C[N];

extern int search(int n,int C[],int i,int h){
  if(h==0){
    return 1;
  }
  else if(i>=n){
    return 0;
  }

  return (search(n, C, i + 1 ,h) || search(n, C, i + 1, h - C[i]));
}

extern void solve(int n,int C[],int q,int H[]){
  int i;
  for(i=0;i<q;i++){
    if(search(n,C,0,H[i])==1)
      printf("yes\n");
    else
      printf("no\n");
  }
}

int main(){
  int n,*H,q,i;
  scanf("%d",&n);

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

