#include<stdio.h>
    
   int S[1000000],N,x;
int solve(int i,int m){
if(m==0){
return 1;
}
if(i>=N){
return 0;
}
 x =solve(i+1,m)||solve(i+1,m-S[i]);
return x;
}


int main(){
   
int i,k,q; 

    
    scanf("%d", &N);
     for ( i = 0; i < N; i++ ){ 
scanf("%d", &S[i]);
}
     
 scanf("%d", &q);
     for ( i = 0; i < q; i++ ){ 
scanf("%d", &k);
 
if(solve(0,k)){
printf("yes\n");
else printf("no\n");
}    
return 0;
}