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

int solve(int, int, int[N], int, int);

int main(){
  int ans, i, j, n, q, a[N], m[Q];

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

  scanf("%d", &q);
  for(j = 0; j < q; j++){
    scanf("%d", &m[j]);
  }

  for(i = 0; i < q; i++){
    ans = solve(0, m[i], a, n, 0);
    if(ans == 1) printf("yes\n");
    else printf("no\n");
  }

  return 0;
}

int solve(int i, int m, int a[N], int n, int res){
  if(m == 0 || res == 1) return 1;
  if(i >= n) return 0;
  
  res = solve(i + 1, m, a, n, res);
  res = solve(i + 1, m - a[i], a, n, res);
  return res;
}