#include <stdio.h>

int n, A[1000];

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

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

