#include<stdio.h>

#define N 2000
#define Q 2000

int solve(int,int);

int n,A[N];

int main()
{

  int q,M[Q],i;

  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++){
    if(solve(0,M[i]) == 1) printf("yes\n");
    else printf("no\n");
  }

  return 0;
}

int solve(i,m){

  int res;

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

  return res;
}