#include <stdio.h>
#define N 20
#define Q 200

int keisan(int *, int, int, int, int);

int main(){

  int i, j;
  int n, q;
  int a[N], m[Q];
  int out;

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

  for(i = 0; i < q; i++){

    out = keisan(&a[0], 0, m[i], 0, n);
      
    if(out == 1) printf("yes\n");
    else printf("no\n");
  }

  return 0;
}

int keisan(int *a, int res, int m, int i, int n){

  if(m == 0 || res == 1) return 1;

  if(i == n) return 0;

  res = keisan(a, res, m - a[i], i + 1, n);

  res = keisan(a, res, m, i + 1, n);

  return res;
}