#include<stdio.h>
int n,A[20];
int solve(int i,int m);
int main(){
  int i,q,m;
  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(solve(0,m)==1) printf("yes\n");
    else printf("no\n");
  }
  return 0;
}

int solve(int i, int m){
  int res;
  if(m==0) return 1; //perfect
  if(i>=n) return 0;//no answer
  res = solve(i+1,m) || solve(i+1,m-A[i]);
  return res;
}
				       

