#include<stdio.h>

int n, A[50];

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-A[i]);
   return res;
}

int main()
{
   int i, q, m;

   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);
      if (solve(0, m))
         puts("yes");
      else
         puts("no");
   }

   return 0;
}