#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define scani(x) scanf("%d",&x)
#define scanc(x) scanf("%s",x)
#define printi(x) printf("%d",x)
#define printin(x) printf("%d\n",x)
#define printc(x) printf("%s",x)
#define repd(i,n,m) for(int i = n; i > m; i--)
#define repu(i,n,m) for(int i = n; i < m; i++)
#define allprintu(i,n,m,a) for(int i = n; i < m; i++){if(i != m-1){printf("%d ",a[i]);}else{printf("%d",a[i]);}}
#define allprintd(i,n,m,a) for(int i = n; i > m; i--){if(i != 0){printf("%d ",a[i]);}else{printf("%d\n",a[i]);}}
	
#define MAX_N 20
#define MAX_Q 200

int n,q;
int a[MAX_N],m[MAX_Q];

int max(int a, int b){
	return (a > b) ? a : b;
}
int all_search(int x,int sum, int i){
	if(sum + a[i] == x){
		return 1;
	}else if(i >= n){
		return 0;
	}else{
		return max(all_search(x,sum+a[i],i+1),all_search(x,sum,i+1));
	}
	
}
int search(int x){
	int i = 0;
	int sum = 0;
	return all_search(x,sum,i);
}

int main(void){
	scani(n);
	repu(i,0,n){
		scani(a[i]);
	}
	scani(q);
	repu(i,0,q){
		scani(m[i]);
	}
	repu(i,0,q){
		if(search(m[i])){
			printf("yes\n");
		}else{
			printf("no\n");
		}
	}
	

	return 0;
}
