#include<stdio.h>

int solve(int i,int m);


int n,q,A[2000],M[2000];

int main(){
  int i,j,ans,flag = 0;
  
  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[i]);

  for(i = 0 ; i < q ; i++){
    flag = 0;
    for(j = 0 ; j < n ; j++){
      ans = solve(j,M[i]);
      if(ans == 0){
	flag = 1;
	printf("yes\n");
	break;
      }
      if(ans == 1){
	flag = 1;
	printf("no\n");
	break;
      }
    }
  }
  return 0;
}


int solve(int i, int m){
  int res1,res2;
  
  if(m == 0)
    return 0;
  
  if(i >= n)
    return 1;

  res1 = solve(i + 1, m);
  res2 = solve(i + 1,m - A[i]);

  if(res1 == 0 || res2 == 0) return 0;
  else return 1;
}