#include<stdio.h>
#define M 20
int n,i,x,res,A[M];

int solve(int i, int x){
  if(x == 0)return 1;
  else if(i>=n)return 0;
  res = solve(i+1, x)|| solve(i+1, x-A[i]);
 return res;
  
}

int main(){
  int m;
  
  scanf("%d", &n);
  for(i=0; i<n; i++){
    scanf("%d", &A[i]);
  }
   scanf("%d", &m);
  for(i=0; i<m; i++){
    scanf("%d", &x);
    if(solve(0,x)== 1)printf("yes\n");
    else if(solve(0,x)== 0)printf("no\n");
  }


  return 0; 
  
}

