/* A Brute Force */

#include<stdio.h>

int A[20]; /*0~20, n<=20*/
int n;

int solve(int,int);

int main(){
  int q, M, i;

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

  scanf("%d",&q);
  for(i=0;i<q;i++){
    scanf("%d",&M);
    if(solve(0,M)==1){
      printf("yes\n");
    }else{
      printf("no\n");
    }
  }
  return 0;
}

int solve(int p, int t){
  int temp1,temp2;
 
  if(t<0)return 0;
  if(t==0)return 1;
  if(p>=n)return 0;

  temp1=solve(p+1,t-A[p]);
  temp2=solve(p+1,t);
  
  if(temp1==1||temp2==1)return 1;
  else return 0;
}