/* ALDS1_5_A: Exhaustive */
/* 20181118 */

#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>

#define N 20
#define M 200

int flag[40000], n, A[N];

void exhaustiveSearch(int m, int sum);

int main(void){
	int i = 0, q, Q[M];
	
	scanf("%d", &n);
	while(i < n){
		scanf("%d", &A[i++]);
	}

	exhaustiveSearch(0, 0);
	i = 0;
	scanf("%d", &q);
	while(i < q){
		scanf("%d", &Q[i]);
		if(flag[Q[i++]]){
			puts("yes");
		}else{
			puts("no");
		}
	}

	return 0;
}

void exhaustiveSearch(int m, int sum){
	if(m == n){
		flag[sum] = 1;
		return ;
	}

	exhaustiveSearch(m + 1, sum);
	exhaustiveSearch(m + 1, sum + A[m]);
}

