#include<stdio.h>

int n, A[50];

int solve(int p, int t){
  if ( p >= n )
    return 0;
  if ( A[p] == t )
    return 1;
  if ( solve(p+1,t) )
    return 1;
  if ( solve(p+1,t-A[p]) )
    return 1;
  return 0;
}

int main(){
  int k, M, i;
  scanf("%d",&n);
  for ( i = 0 ; i < n ; i++ )
    scanf("%d",&A[i]);
  scanf("%d",&k);
  for ( i = 0 ; i < k ; i++ ) {
    scanf("%d",&M);
    if ( solve(0,M) )
      printf("yes\n");
    else printf("no\n");
  }
  return 0;
}

