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

int A[2000];

 int search(int n,int A[],int i,int m){
  
  if(m == 0) return 1;

  else if(i >= n) return 0;
  
  return (search(n, A, i + 1, m) || search(n, A, i + 1, m - A[i]));
}


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

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

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

  solve(n,A,q,M);
  
  return 0;
}

