#include <stdio.h>
int n,a[200];
int solve(int,int);
int main()
{
  int q,m[200],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 if(solve(0,m[i])==0) printf("no\n");
    }
  
  return 0;
}
int solve(int i,int m)
{
  int result;
  if(m==0)return 1;
  if(i>=n)return 0;
  result = solve(i+1,m)||solve(i+1,m-a[i]);
  return result;
}

