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

int solve(int, int);

int A[N], n = 0;

int main(){
  int q = 0;
  int i = 0;
  int m[N];

  /*Input A[N]*/
  scanf("%d",&n);
  for(i = 0; i < n; i++){
    
    scanf("%d",&A[i]);
    
  }

  /*Input m[N]*/
  scanf("%d",&q);
  for(i = 0; i < q; i++){
    
    scanf("%d",&m[i]);
    
  }

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

int solve(int i, int m){ /* i番目以降の要素を使ってmを作れる -> true */
  int res = 0;
  
  if(m == 0)return TRUE;
  if(i >= n)return FALSE;

  res = solve(i+1, m) || solve(i+1, m-A[i]);
  return res;
}

