#include <stdio.h>
int A[2000],m[2000],n;
int solve(int,int);
int main(){
  int i,q;

  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++){
    if(solve(i,n)==0) printf("yes\n");
    if(solve(i,n)==1) printf("no\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;
}

