#include <stdio.h>

#define M 1233361
#define NIL (-1)

int A[M];

int h1(int key) { return key % M; }
int h2(int key) { return 1 + (key % (M - 1)); }

int find(int val)
{
	int i, h;
	for (i = 0; ; i++)
	{
		h = (h1(val) + i * h2(val)) % M;
		if (A[h] == val) return 1;
		else if (A[h] == NIL) return 0;
	}
}

int insert(int val)
{
	int i, h;
	for (i = 0; ; i++)
	{
		h = (h1(val) + i * h2(val)) % M;
		if (A[h] == val) return 1;
		else if (A[h] == NIL)
		{
			A[h] = val;
			return 0;
		}
	}
}

void calc(int i, int w, int n)
{
	int k, w2;

	for (k = i; k < n; k++)
	{
		w2 = w + A[k];
		insert(w2);
		calc(k + 1, w2, n);
	}
}

int main(void)
{
	int n, i, val;

	for (i = 0; i < M; i++) A[i] = NIL;

	scanf("%d", &n);

	for (i = 0; i < n; i++) scanf("%d", &A[i]);

	calc(0, 0, n);

	scanf("%d", &n);
	for (i = 0; i < n; i++)
	{
		scanf("%d", &val);
		if (find(val)) printf("yes\n");
		else printf("no\n");
	}

	return 0;
}