#include<stdio.h>
int solve(int i, int m, int n, int A[]) {
   int res;
   if (m == 0)
	  return 1;
   if (i >= n)
	  return 0;
   res = solve(i + 1, m, n, A) || solve(i + 1, m - A[i], n, A);
   return res;
}

int main()
{
   int na, nq, i, tf;
   int A[20], Q[200];

   i = 0;
   scanf("%d", &na);
   while (i < na) {
	  scanf("%d", &A[i]);
	  i++;
   }
   i = 0;
   scanf("%d", &nq);
   while (i < nq) {
	  scanf("%d", &Q[i]);
	  i++;
   }

   for (i = 0; i < nq; ++i) {
	  tf = solve(0, Q[i], na, A);
	  if (tf)
		 printf("yes\n");
	  else
		 printf("no\n");
   }
   return 0;
}