#include<stdio.h>
#define N 2000

void rec(int,int,int *);
int solve(int,int,int *,int);

int main(){
  int n,q,A[N],m[N],i,j,k,x,L[N];

  scanf("%d",&n);
  for(i=0;i<n;i++)scanf("%d",&A[i]);
  scanf("%d",&q);
  for(j=0;j<q;j++)scanf("%d",&m[j]);

  for(i=0;i<q;i++){
    x=solve(0,m[i],A,n);
    if(x==1)printf("yes\n");
    if(x==0)printf("no\n");
  }
  return 0;
}

int solve(int i,int m,int *A,int n){
  int res1,res2;
  if(m==0){
    return 1;
  }
  if(i>=n){
    return 0;
  }
  res1=solve(i+1,m,A,n);
  if(res1==1) return 1;
  res2=solve(i+1,m-A[i],A,n);
  if(res2==1) return 1;
  if(res1==0 && res2==0)return 0;
}

