#include<stdio.h>
int n,A[2000];
int solve(int x, int y){
  int res;
  if(A[x]==y) return 1;
  if(x>=n) return 0;
  res=solve(x+1,y) || solve(x+1,y-A[x]);
  return res;
}

int main(){
  int i,p,m;
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
  }
  scanf("%d",&p);
  for(i=0;i<p;i++){
    scanf("%d",&m);
    if (solve(0,m)==1) printf("yes\n");
    else printf("no\n");
  }
  return 0;
}

