#include <stdio.h>

int a[200],n,q,b[2000];

int solve(int,int);

int main(){

  int i,j;

  scanf("%d",&n);
  for(i=0;i<n;i++) scanf("%d",&a[i]);
  scanf("%d",&q);
  for(i=0;i<q;i++) scanf("%d",&b[i]);

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

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

  return 0;

}

int solve(int i,int m){

  int res;

  if(m==0) return 1;

  if(i>=n) return 0;

  return  res=solve(i+1,m) || solve(i+1,m-a[i]);

}