#include<stdio.h>

int judge(int A[], int n, int num, int i){
	int next_num = num - A[i];
	int a, b;
	if (next_num == 0) {
		return 1;
	} else if (next_num < 0) {
		return 0;
	} else if (i < n) {
		a = judge(A, n, next_num, i+1);
		b = judge(A, n, num, i+1);
		if (a || b) {
			return 1;
		} else {
			return 0;
		}
	} else {
		return 0;
	}
}

int main(){
	int n, A[20];
	int q, m[200];
	int 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[j]);
	}

	for (j = 0; j < q; j++) {
		if (judge(A, n, m[j], 0)) {
			printf("yes\n", m[j]);
		} else {
			printf("no\n", m[j]);
		}
	}
	return 0;
}