#include<stdio.h>
#define N 2000
int i, n,q,A[N],mi[N];
int solve(int i, int m){
  if(m == 0) return 1;
  if(i >= n) return 0;
  int res=solve(i+1,m)||solve(i+1,m-A[i]);
   return res;
}

  
int main(){
  scanf("%d", &n);
  for(i = 0; i < n; i++){
    scanf("%d", &A[i]);
  }
  scanf("%d", &q);
   for(i = 0; i < q; i++){
   scanf("%d", &mi[i]);
   }

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