#include <stdio.h>
#define N 2000

int n,A[N],q,M[N];

int solve(int i, int m){
	if(i==n-1) return 0;
    if(A[i]==m) return m == 1;  
    if(solve(i+1, m) || solve(i+1, m - A[i])) return 1; 
    return 0;
}

int main(){
int i,j;

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[i]);
}

for(i=0;i<q;i++){
if(solve(i,M[i]) == 1) printf("yes\n");
else printf("no\n");
}

return 0;
}