/* 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(n-1,M)==0){
      printf("yes\n");
    }else{
      printf("no\n");
    }
  }
  return 0;
}

int solve(int p, int t){
  //printf("   t:%d\n",t);
  if(p<0)return t;
  if(t==0)return t;
  if(t>=A[p])return solve(p-1,t-A[p]);
  else return solve(p-1,t);
}