#include<stdio.h>
#include<stdlib.h>

int solve(int query,int currentIndex,int *list,int length){
  if ( currentIndex == length )
    return 0;
  if ( query - list[currentIndex] == 0 )
    return 1;
  else if ( query - list[currentIndex] > 0 )
    return solve(query-list[currentIndex],currentIndex+1,list,length)
      || solve(query,currentIndex+1,list,length);
  return solve(query,currentIndex+1,list,length);
}

int main(){
  int n, q, i, currentQuery;
  scanf(" %d",&n);
  int *toSum = (int *) malloc(sizeof(int[n]));
  for ( i = 0; i < n; i++ )
    scanf(" %d",toSum+i);
  scanf(" %d",&q);
  for ( i = 0; i < q; i++ ){
    scanf(" %d",&currentQuery);
    printf("%s\n",solve(currentQuery,0,toSum,n) ? "yes" : "no");
  }
  return 0;
}

