#include <stdio.h>
#define N 20
#define Q 200

int search(int,int,int,int *);

int main(){
  int n,q,a[N],m[Q],i;
  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++){
    if(search(0,m[i],n,a)) printf("yes\n");
    else printf("no\n");
  }
  return 0;
}

int search(int i,int m,int n,int a[]){
  int judge;
  if(m==0) return 1;
  if(i>=n) return 0;
  judge=(search(i+1,m,n,a) || search(i+1,m-a[i],n,a));
  return judge;
}

