#include<iostream>
using namespace std;
int n,a[50],q,m;
int dfs(int i,int m){
	if(m==0) return 1;
	if(i>=n) return 0;
	if(m<0) return 0;
	int x=(dfs(i+1,m)||dfs(i+1,m-a[i]));
	return x;
}
int main(){
	cin>>n;
	for(int i=0;i<n;i++) 
	cin>>a[i];
	cin>>q;
	for(int i=1;i<=q;i++){
		cin>>m;
		if(dfs(0,m)){
			cout<<"yes"<<endl;
		}else{
			cout<<"no"<<endl;
		}
	}
	return 0;
}
