#include<stdio.h>
#define N 20
#define Q 200
#define B 2000
#define TRUE 1
#define FALSE 0

int A[N];
int M[Q];
int n,q,j,s;
void recursion(int,int);
main()
{

  scanf("%d",&n);

  for(j=0;j<n;j++)
    {
      scanf("%d",&A[j]);
    }

  scanf("%d",&q);

  for(j=0;j<q;j++)
    {
      scanf("%d",&M[j]);
    }
  

  for(j=0;j<q;j++)
    {
      s = 0;
      recursion(0,M[j]);
   
    if(s==0)
      {
	printf("no\n");
      }
    

  }

 return 0;
}

void recursion(int soe, int  seisu)
{
  if(soe<N && s==0 && seisu>0)
    {
      if(seisu == A[soe])
	{
	  printf("yes\n");
	  s++;
	  
	}
    

  recursion(soe+1,seisu-A[soe]); /*i?????????????´?  ?????¶*/
  /*printf("%d\n",seisu);*/
  recursion(soe+1,seisu); /*i?????????????´?????????°??????*/
    }
}