#include <stdio.h>

#define N 20
#define Q 200

int n;
int A[N];

int solve(i, m) {
	if (m == 0) return 1;

	if (i >= n) return 0;

	if (solve(i+1, m) || solve(i+1, m-A[i])) return 1;

	return 0;
}

int main() {
	int i;
	int q;
	int M[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", &M[i]);

	for (i = 0; i < q; i++) {
		if (solve(0, M[i])) printf("yes\n");
		else printf("no\n");
	}

	return 0;
}