#include <stdio.h>
int A[2000],M[2000],n;
int main(){
  int 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]) > 0) printf("yes\n");
    else printf("no\n");
  }
  return 0;
}

int solve(int x,int m){
  int res;
  if(m==0) return 1;
  if(x>=n) return 0;
  res = solve(x+1,m)+solve(x+1,m-A[x]);
  return res;
}