#include <stdio.h>

int n1,num1[20];
    

int solve(int i,int m)
{
  int res;
  
  if(m==0){
    return 1;
  }
  if(i>=n1) return 0;

  res=solve(i+1,m);
  if(res!=1) res=solve(i+1,m-num1[i]);
  return res;
}


int main()
{
  int n2,i,num2,tf;

  scanf("%d",&n1);
  for(i=0;i<n1;i++) scanf("%d",&num1[i]);

  scanf("%d",&n2);
  for(i=0;i<n2;i++){
    scanf("%d",&num2);
    tf=solve(0,num2);
    if(tf==1) printf("yes\n");
    else printf("no\n");
  }
  return 0;
}

  

