#include<stdio.h>
#define N 1000

int A[N],B[N],n,m;
int solve(int,int);

int solve(int i, int k){
  int res;
  if ( k == 0 ) return 1; // true
  if ( i >= n ) return 0; // false
  res = solve(i + 1, k) || solve(i + 1, k - A[i]);
  return res;
}

int main(){

  int i,flag=1;

  scanf("%d",&n);
  for( i = 0 ; i < n ; i++ ){
    scanf("%d",&A[i]);
  }

  scanf("%d",&m);
  for( i = 0 ; i < m ; i++ ){
    scanf("%d",&B[i]);
    flag = solve(0,B[i]);
    if( flag == 0 ) puts("no");
    else puts("yes");
      }
  return 0;
}