#include<stdio.h>

#define N 20
#define Q 200

int solve(int,int);

int A[N],M[Q];
int count,n;

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

int solve(int i,int m){
  if(i<n &&count==0&& m>0){
    if(A[i]==m){
      count++;
      return 1;
    }
  solve(i+1,m-A[i]);
  solve(i+1,m);
  }
}