#include<stdio.h>
int n,A[20];

int search(int i,int m){
  if(m == 0) return 1;
  if(i >= n) return 0;
  int res = search(i+1,m)||search(i+1,m-A[i]);
  return res;
}
      
int main(){
  int q,m,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);
    if(search(0,m))
      printf("yes\n");
    else printf("no\n");
  }
  return 0;
}

