#include<stdio.h>

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

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