#include <stdio.h>

int solve(int,int);

int n;
int A[2000],b[2000];

int main(){

  int i,j,k;
  int judge;

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

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

  for(i=0; i<n-1; i++){

    judge = solve(0,b[i]);
    if(judge == 0) printf("yes\n");
    else printf("no\n");
  }

  return 0;
}

int solve(int i, int m){

  int res;

  if(m==0) return 0;

  if(i>=n) return 1;

  res = solve(i+1,m);
  if(res == 0) return res;
  
  res = solve(i+1, m-A[i]);

  return res; 
}