#include <stdio.h>

int solve(int,int);
//int makeCombination();
//int rec(int);

int A[2000];  
int n;

int main(){

  int mi[2000];
  int q;
 
  int 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",&mi[i]);
    
    if( solve(0, mi[i]) ) printf("yes\n");
    else   printf("no\n");
  }

  return 0;

}
	
int solve(int i, int m){

  if(m == 0) return 1;
  if(i >= n) return 0;

  int res = solve(i+1,m) || solve(i+1,m-A[i]);

  return res;
}