#include<stdio.h>
#define X 2000

int n,A[X];
int solve(int, int);

int main(){

  int i,q;
  int m[X];

  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){

  if(m == 0)return 1;
  if(i >= n)return 0;
  int res1 = solve(i+1,m-A[i]);
  if(res1 == 1)return 1;

  int res2 = solve(i+1,m);
  if(res2 == 1)return 1;
  return 0;
}