#include<stdio.h>

#define N 2000

int solve(int,int);

int a[N],n;

int main(){
  int q,b[N],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",&b[i]);
  }

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



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

    if(i>=n) return 0;

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

    return res;
}
    
		       
  

