#include<stdio.h>
#define N 2000

int n, A[N];

int solve(int, int);

int main(){
  int q, m, 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", &m);
    if ( solve(0, m)==1){
      printf("yes\n");
    }
    else printf("no\n");
  }
  return 0;
}
int solve(int i, int m){
  if ( i >= n ) return 0;
  if ( A[i] == m ) return 1;
  if ( solve(i+1, m) ) return 1;
  if ( solve(i+1, m-A[i]) ) return 1;
  return 0;
}