#include <stdio.h>
#define N 2000

int n,A[N];
int makeCombination(int);
int solve(int ,int);

int main(){
    
    int i,j,q,B[N];
    scanf("%d",&n);
    for(i = 0; i < n;i++){
        scanf("%d",&A[i]);
    }
    scanf("%d",&q);
    for(i = 0; i < q;i++){
        scanf("%d",&B[i]);
    }

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

    return 0;
}
/*
int makeCombination(int x){
    int i;

    for(i = 0;i < n-1; i++){
        S[i] = 0;
        makeCombination(0);
    }

    makeCombination(i);
    if(i == n){
        printf("%d",S[i]);
        return 0;
    }

    makeCombination(i+1){
        S[i] = 1;
        makeCombination(i+1);
        S[i] = 0;
    }
}
*/

int solve(int i,int m){
    int res;
    if(m==0){
        return 1;
    }
    if(i >= n){
        return 0;
    }

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