#include <stdio.h>
 
#define N 20
#define Q 200
 
int solve(int, int);
 
int a[N];
int n, flag =0;

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