#include<stdio.h>

int m[2200], n;

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


int main()
{
	int q, k;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
		scanf("%d", &m[i]);
	scanf("%d", &q);
	for (int i = 0; i < q; i++)
		scanf("%d", &k), printf("%s", solve(0, k) ? "yes\n" : "no\n");
		

}
