#include<stdio.h>
int solve(int, int);
int A[2001];
int n;

int main(){
  int i, j, q, c=0;
  int M[2001];
  
  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++){
    if(solve(0,M[i]) == 1){
      printf("yes\n");
    }
    else printf("no\n");
  }
  
  
  return 0;
}



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