#include <stdio.h>
int n,A[20];
int solve(int count,int num)
{
	if(num==0)	
	return 1;
	/*if(count>n||num<0)
	return 0;
	if(solve(count+1,num-A[count])||solve(count+1,num))
	return 1;
	return 0;*/
	if(count>n)
	return 0;
	int res=(solve(count+1,num-A[count])||solve(count+1,num));
	return res;
}

int main(int argc, char *argv[])
{
	int q,m,i;
	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);
		if(solve(0,m))
		printf("yes\n");
		else
		printf("no\n");
	}
	return 0;
}
