/*
 *	Argorithms and Data Structures
 *	Lectuire 5 
 *	Exhaustive Search
 */

#include <stdio.h>

#define N 20
#define Q 200
#define TRUE 1
#define FALSE 0

int A[N], M[Q];
int n, q;

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

int main(void){
	int i;

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

	return 0;
}