#include <stdio.h>
#define N 2000

int search(int, int);

int A[N] ,anum;

int main(){
  int Q[N];
  int i, qnum;

  scanf("%d", &anum);
  for(i = 0; i < anum; i++){
    scanf("%d", &A[i]);
  }
  scanf("%d", &qnum);
  
  for(i = 0; i < qnum; i++){
    scanf("%d", &Q[i]);
  }
  
  for(i = 0; i < qnum; i++){
    if(search(0,Q[i]) == 1){
      printf("yes\n");
    }
    else{
      printf("no\n");
    }
  }
  return 0;
}

int search(int i, int num){
  int res;
  
  if(num == 0){
    return 1;
  }
  if(i >= anum){
    return 0;
  }

  res = search(i+1,num) || search(i+1 ,num - A[i]);
  return res;
}

