#include<stdio.h>

int solve(int ,int );

int n,A[2000];

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

int solve(int i, int m){
  int res1,res2;
  if(m==0) return 1;
  if(i>=n) return -1;
  res1=solve(i+1,m);
  res2=solve(i+1,m-A[i]);
  if(res1==1||res2==1) return 1;
  return -1;
}

