#include<stdio.h>
int n, A[30];

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

int main(){
	int q, m, j;
	scanf("%d", &n);
	for (j = 0; j < n; j++) {
		scanf("%d", &A[j]);
	}
	scanf("%d", &q);
	for (j = 0; j < q; j++) {
		scanf("%d", &m);
		if (solve(0, m)) {
			printf("yes\n");
		} else {
			printf("no\n");
		}		
	}
	return 0;
}