
#include<stdio.h>
#include<string.h>

#define MAX 1000
int T[MAX];
int TT[MAX];
int n, k, p;


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


int main(){
	int i = 0;
	int q;
	int M;
	long long ans;

	scanf("%d", &n);

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

	scanf("%d", &q);

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

return 0;

}


int check(long long p){
	long long sum = 0;
	int i = 0;
	int j;

	for (j = 0; j < k; j++){
		sum = 0;
		while (sum + T[i] <= p){
			sum += T[i];
			i++;
			if (i == n) return n;
		}
	}
	return i;

}