#include <stdio.h>

int solve(int,int);

int A[20],n;

int main() {

  int i,q,x,m[200];

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

  return 0;
}

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

  res = solve(i + 1, m);
  res1 = solve(i + 1, m - A[i]);

  if(res == 1 && res1 == 1)
    return 1;
  else if(res == 1 && res1 == -1)
    return 1;
  else if(res == -1 && res1 == 1)
    return 1;
  else return -1;
}

