#include <stdio.h>
int A[2000],n,flag;
int solve(int p,int t){
  int ans1,ans2;
  if (p<=n){
      solve(p+1,t-A[p]);
      solve(p+1,t);
  } else {
    if(t==0){
      flag=1;
    }
  }
}

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