#include <stdio.h>

int n, A[2000];


int ExhaustiveSearch(int i, int m){
    if(m == 0)
    return 1;
    if(i >= n)
    return 0;

    int res = ExhaustiveSearch(i + 1, m) || ExhaustiveSearch(i + 1, m - A[i]);
    return res;
}



int main(){

	int i, q, M;
	
	scanf("%d\n", &n);
	for(i = 0; i < n; i++)
	scanf("%d",&A[i]);
	
	scanf("%d\n", &q);
	for(i = 0; i < q; i++){
	scanf("%d", &M);
	if (ExhaustiveSearch(0,M))
	    printf("yes\n");
	else
	    printf("no\n");
	
	}
	
	
	return 0;
}