#include <stdio.h>
#define N 20
#define QN 200
int n,A[N];
int solve(int,int);

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

  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(int i, int m){
  if(m == 0) return 1;
  if(i >= n) return 0;
  if(solve(i+1,m) == 1 || solve(i+1,m-A[i]) == 1) return 1;
}