#include<stdio.h>
#define N 20
#define Q 200
#define TRUE 1
#define FALSE 0

int solve(int,int);

int n,A[N];

int main(){
  int q,M[Q];
  int i,j;

  /*    i n p u t   */
  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]);
  }


  /*   o u t p u t   */
  for(i=0;i<q;i++){
      
    if(solve(0,M[i]))
      printf("yes\n");
    else
      printf("no\n");
  }

  return 0;
}


int solve(int i, int m){
  
  int res;
  
  if(m==0) return TRUE;

  if(i>=n) return FALSE;

  if( solve(i+1,m) || solve(i+1,m-A[i]) ) return TRUE;

}