#include<stdio.h>
  
#define AMAX 20
#define MMAX 2000
  
int n, q;
int A[AMAX+1];
int isExist[ MMAX+1 ] = {0};
 
void solve( int p, int t  )
{
	isExist[ t ] = 1;
    if( p <= n ) {
    	solve( p+1, t-A[p] );
    	solve( p+1, t  );
    }
    return ;
}
 
int main( void ) 
{
    int i;
    int num;
    int sum;
    
    scanf( "%d", &n );
    sum = 0;
    for( i=0; i<n; i++ ) {
        scanf( "%d", &A[i] );
        sum += A[i];
    }
    solve( 0, sum );
    
    scanf( "%d", &q );
    for( i=0; i<q; i++ ) {
        scanf( "%d", &num );
        if( isExist[ num ] ) {
            printf( "yes\n" );      
        } else {
            printf( "no\n" );
        }
    }
    return 0;
}