#include <stdio.h>
#define N 2000
#define Q 2000
#define TRUE 1
#define FALSE 0
int flag, n;
int A[N];

int solver(int i, int m){
  if(i >= n) return FALSE;
  else if(m < 0) return FALSE;
  else if(m == 0 || m - A[i+1] == 0){
    flag = TRUE;
    return TRUE;
  }
  else{
    solver( i + 1, m);
    solver( i + 1, m - A[i]);
  }
}

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

  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]);

    solver(-1, M[i]);
  if(flag == TRUE)printf("yes\n");
  else printf("no\n");
  }
   
  return 0;
}