// AOJ ALDS1_5_A Exhaustive Search
// 2018.4.30 bal4u

#include <stdio.h>

#if 1
#define gc() getchar_unlocked()
#else
#define gc() getchar()
#endif
int in()
{
	int n = 0, c = gc();
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

char f[2002];
short que[2002]; int top, end;

int main()
{
	int n, a, q;
	int stop, x;
	
	n = in(), que[0] = 0, end = 1;
	while (n--) {
		stop = end;
		a = in();
		for (top = 0; top < stop; top++) {
			x = que[top] + a;
			if (f[x]) continue;
			f[x] = 1, que[end++] = x;
		}
	}

	q = in();
	while (q--) {
		puts(f[in()]? "yes": "no");
	}
	return 0;
}
