#include <stdio.h>
#define MAX 2000

int n;
int N[MAX];

int fanc(int, int);

int main(){
  int i,judge;
  int q;
  int Q[MAX];

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

  for(i=0;i<q;i++){
    judge = fanc(0,Q[i]);

    if(judge == 1){
      printf("yes\n");
    }
    else printf("no\n");
  }

  return 0;
}
int fanc(int i, int m){
  int res;
  
  if(m==0) return 1;
  if(i>=n) return 0;

  res = fanc(i+1, m) || fanc(i+1, m-N[i]);

  return res;
}