#include <stdio.h>

int solve(int,int);

int n;
int A[2000];

int main(void){

  int M[200];
  int i,j,q;

  scanf("%d",&n);

  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
  }

  scanf("%d",&q);

  for(j=0;j<q;j++){
    scanf("%d",&M[j]);
  }

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

int solve(int i,int m){

  int res;

  if(i == n && m == 0){
    return 1;
  }
  if(i == n && m != 0){
    return 0;
  }
  res = solve(i + 1,m) + solve(i + 1,m - A[i]);
  return res;
}