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

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

int solve(int index, int sum) {
	if (index == n || sum == 0) {
		return sum == 0;
	} else if (sum >= A[index + 1] 
		&& solve(index + 1, sum - A[index + 1])) {
		return 1;
	} else {
		return solve(index + 1, sum);
	}
}

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

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

	return 0;
}