#include<stdio.h>
#define TRUE 1
#define FALSE 0

int n, A[20];

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

int main() {
  int q, i, B[200], x;

  scanf("%d", &n);
  for(i = 0; i < n; i++) {
    scanf("%d", &A[i]);
  }
  scanf("%d", &q);
  for(i = 0; i < q; i++) {
    scanf("%d", &B[i]);
  }

  for(i = 0; i < q; i++) {
    x = search(0, B[i]);
    if(x == TRUE) printf("yes\n");
    if(x == FALSE) printf("no\n");
  }
  return 0;
}