#include<stdio.h>
#define N 2000
int n,S[N];

int solve(int m,int key){
   if( m >= n)
    return 0;
  if( S[m] == key)
    return 1;
  if( solve(m+1, key))
    return 1;
  if( solve(m+1, key-S[m]))
    return 1;
}


    

int main(){
  int m,i,key,a;
  scanf("%d", &n);
  for(i = 0; i < n; i++)
    scanf("%d", &S[i]);
  
  scanf("%d", &m);
  for(i = 0; i < m; i++){
    scanf("%d", &key);
    a = solve(0,key);
    if( a == 1)
      printf("yes\n");
    else
      printf("no\n");
  }

  return 0;
}


