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

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

