#include<stdio.h>

int n, A[20];

int solve(int, int);

int main()
{
  int i, q, res, m[200];

  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++){
    res = solve(0, m[i]);

    if(res == 0) printf("yes\n");
    else if(res == 1) printf("no\n");
  }

    return 0;
}

int solve(int i, int m)
{
  int res;

  if(m == 0) return 0;
  if(i >= n) return 1;
  if(solve(i+1, m) == 0 || solve(i+1, m-A[i]) == 0) return 0;
}