#include<stdio.h>

int n, N[20];

int solve(int i, int m) {
   if(m==0)
      return 1;
   if(i>=n)
      return 0;
  int res=solve(i+1, m) || solve(i+1, m-N[i]);
  return res;
}

int main() {

 int q, m[200], i, j, k;

  scanf("%d",&n);
  for(i=0; i<n; i++)
     scanf("%d",&N[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;
}