#include<stdio.h>

#define N 20
#define Q 200

int solve(int, int);

int a[N];
int m[Q];
int n;

int main(){
int i, q;
  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]);
     if(solve(0,m[i])>=1) printf("yes\n");
     else printf("no\n");
   }
   return 0;
}

int solve(int i, int k){
  int res;

  if(k == 0) return 1;
  else if(i >= n) return 0;
  res = solve(i+1, k) + solve(i+1, k-a[i]);
  return res;
}