#include <stdio.h>
#include <math.h>
#include <stdbool.h>

//????????????????????£?¨?.
void makeCombination(int *s, int n);
int sumup(int *s, int *a, int n);

int main(void) {
	int s[20] = { 0 };				//??????????????????.
	int a[20] = { 0 };				//???????????°.
	int n = 0;						//???????????°????????°.
	int sum = 0;					//????¨?.
	int q = 0;						//???????????°????????°.
	int m[200] = { 0 };				//?????´????????????????????°???.
	bool find = false;				//?????´????????????????????°.

	long long int i = 0;
	int j = 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 (j = 0; j < q; j++) {

		i = 0, find = false;			//?????????.

		while (i < (int)pow(2, (double)n) && find == false) {

			makeCombination(s, n);

			sum = sumup(s, a, n);

			if (sum == m[j]) {
				printf("yes\n");
				find = true;
			}

			i++;
		}

		if (!find)
			printf("no\n");
	}

	return 0;
}

//????????°??????????????????????????????.
void makeCombination(int *s, int n) {
	int i = 0;
	bool fin = false;

	while (!fin) {
		if (s[i]) s[i] = 0;
		else s[i] = 1, fin = true;
		i++;
	}
}

//????????°???????¶?????????????.
int sumup(int *s, int *a, int n) {
	int sum = 0;
	int i = 0;

	for (i = 0; i < n; i++)
		if (s[i]) sum += a[i];

	return sum;
}