#include <stdio.h>
#define N 20
#define Q 200

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

int main(){
  int sum=0,m[Q],q,i,j,count=0;

  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++){
    j=solve(count,m[i]);
    if(j==1) printf("yes\n");
    else printf("no\n");
  }

}

int solve(int count,int m){
  int res;
  if(m==0) return 1;
  if(count>=n) return 0;
  res=solve(count+1,m)||solve(count+1,m-A[count]);
  return res;
}

