#include <stdio.h>
#define N 2000
#define CO 190
int A[N],n;

int main(){
  int B[CO],M[200],i,n1,j,k,count=0,p;

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

  scanf("%d",&n1);

  for(i=0;i<n1;i++){
    scanf("%d",&k);
      p=solve(0,k);
    if(p==1)
	printf("yes\n");
    else
      printf("no\n");
  }

  return 0;
}

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