#include <stdio.h>
int solve(int A[], int size, int i, int m){
  int res=0;
  if(m==0)
	return 1;
  if(i>=size)
	return 0;
  res=solve(A, size, i+1, m)||solve(A, size, i+1, m-A[i]);
  return res;
}
int main(){
  int n, q, A[22];
  scanf("%d", &n);
  int i;
  int key;
  for(i=0; i<n; ++i){
	scanf("%d", &A[i]);
  }
  scanf("%d", &q);
  for(i=0; i<q; ++i){
	scanf("%d", &key);
	if(solve(A, n, 0, key)==1)
	  printf("yes\n");
	else if(solve(A, n, 0, key)==0)
	  printf("no\n");
  }
  return 0;
}

