#include <stdio.h>
int solve(int,int);
int n1,a[20];
int main(){
  int n2,b[200],i,j,count=0,flag,x;
  scanf("%d",&n1);
 
  for(i=0;i<n1;i++) scanf("%d",&a[i]);
 
  scanf("%d",&n2);
 
  for(i=0;i<n2;i++) scanf("%d",&b[i]);

  for(i=0;i<n2;i++){
    if(solve(0,b[i])==1)  
      printf("yes\n");
    else 
      printf("no\n");
  }return 0;
}

int solve(int i,int m){
  int res;  
  if (m==0)return 1;
  if(i>=n1)return 0;

  res=solve(i+1,m)+solve(i+1,m-a[i]);
  return res;


}