#include<stdio.h>
#define N 2000

int fanc1(int *, int, int, int,int);
int fanc2(int *, int, int, int, int);
int ruijou(int);
int kaijou(int);
int res(int, int);
void solv1(int A[], int mi, int n, int a);
  void solv2(int A[], int mi, int n, int a);

int j=0;
int main(){
  int n, q, a=0,i;
  int A[N],m[N],f;

  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++){
    f=fanc1(A,m[i],n,a,j);
    if(f==1)
      printf("yes\n");
    else{
 
      printf("no\n");
    }
  }

  return 0;
  
}
  

int fanc1(int A[], int mi, int n, int a, int i)
{

  int f, count,result;

  if(a==mi)
    return 1;
  if(i>=n){
      return 0;    
  }
  else{
    result=fanc1(A,mi,n,a,i+1)||fanc1(A,mi,n,a+A[i],i+1);
    return result;
  }
}

int fanc2(int A[], int mi, int n, int a, int i)
{

  int f, count,res;
  printf("%d\n",a);
  if(a==mi)
    return 1;
  if(i>=n){
      return 0;    
  }
  else{
    fanc1(A,mi,n,a,i+1);
    fanc2(A,mi,n,a+A[i],i+1);
  }
}

/*void solv1(int A[], int mi, int n, int a)
{
   fanc(A,mi,n,a);
   
}

void solv2(int A[], int mi, int n, int a)
{
 fanc(A,mi,n,a);
 
}
*/

int res(int n, int count)
{
  int b;
  b=ruijou(n+1);
  if(count>=b)
    return 0;
}

int kaijou(int n)
{
  if(n==0)
    return 1;
  else return n*kaijou(n-1);
  
}

int ruijou(int n)
{
  int i,a=1;
  for(i=0;i<n;i++){
    a= a*2;
  }
    return a;
}

