#include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<numeric>
#include<sstream>
#include<iostream>
#include<algorithm>
#include<functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,b,n) for(int i=b;i<n;i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

int main(){
	int n;
	int q;
	cin>>n;
	int A[20];
	rep(i,n){
		cin>>A[i];
	}
	sort(A,A+n);
	cin>>q;
	int M[200];
	rep(i,q){
		cin>>M[i];
	}
	int sum;
	bool flag[200] ={false};
	rep(i,1<<n){
		sum = 0;

		rep(j,n){
			if((i&(1<<j))){
				sum +=A[j];
				rep(k,q){
					if(flag[k])continue;
					if(sum==M[k]){
						flag[k] = true;
					}
				}
			}
		}
	}
	rep(i,q){
		if(flag[i]){
			cout <<"yes"<<endl;
		}else
			cout <<"no"<<endl;
	}
	return 0;
}