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

int judge(int i, int m) {
	if (m == 0) {
		return 1;
	}
	if (i >= n) {
		return 0;
	}

	int res = judge(i + 1, m) || judge(i + 1, m - A[i]);

	return res;
}

int main(void)
{
	int q, m[100000];
	int i, j, k, l = 0;
	int min, max, mid;
	int count = 0;

	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 (judge(0, m[i])) {
			printf("yes\n");
		}
		else
		{
			printf("no\n");
		}

	}
	return 0;
}
 

