#include<stdio.h>

int n,A[2000];

int solve(int,int);

int main(){

  int q,mi[2000],i,left=0,right;

  scanf("%d",&n);

  for(i=0;i<n;i++){

    scanf("%d",&A[i]);

  }

  right = n;
  
  scanf("%d",&q);

  for(i=0;i<q;i++){

    scanf("%d",&mi[i]);
    
  }

  for(i=0;i<q;i++){

    if(solve(0,mi[i])==1) printf("yes\n");
    else printf("no\n");

  }
  return 0;
}

int solve(i,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;

}