#include <stdio.h>
#define TRUE 1
#define FAULSE 0
#define N 20
#define M 2000

int solve( int [], int, int );
int n;

int main (){
    int q, A[N], Q[M], i;

    //input area
    scanf("%d", &n);
    for (i = 0; i<n; i++)
	scanf("%d", &A[i]);
    scanf("%d", &q);
    for (i = 0; i<q; i++)
	scanf("%d", &Q[i]);

    //check whether we can synthesize the A-number frome the Q-number
    for (i = 0; i<q; i++){
	if (solve(A, 0, Q[i]) == TRUE )
	    printf("yes\n");
	else 
	    printf("no\n");
    }
    return 0;
}

int solve(int A[], int x, int m ){

    if (m == 0)
	return TRUE;
    
    if (x >= n)
	return FAULSE;

    if (solve( A, x+1, m-A[x] ) == TRUE) return TRUE; //choice version
    if (solve( A, x+1, m) == TRUE) return TRUE;//non-choice version
    else 
	return FAULSE;
}

