#include <stdio.h>

int solve1(int, int *, int, int);

int main(){
  int n, a[20], q, mi[200], i, 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" ,&mi[i]);

  for(i = 0; i < q; i++){
    x = solve1(n, a, 0, mi[i]);
    if(x == 1) printf("yes\n");	 
    else printf("no\n");
    }
  return 0;
}

int solve1(int n, int *a, int i, int mi){ 
  int res1;

  if(mi == 0) return 1;
  else if(i >= n) return 0;

  res1 = solve1(n, a, i + 1, mi) || solve1(n, a, i + 1, mi - a[i]);
  return res1;
}