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

int solve(int,int);

int n,a[N];

int main()
{
  int m[M],q,i,b;

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

  return 0;
}


int solve(int i,int m)
{
  int res;
  if(m==0) return 1;
  else if(i>=n) return 0;

  res = solve(i+1,m-a[i]) || solve(i+1,m);
  return res;
}

