/*
   AOJ - ALDS_1_5_a
Date: 20181220
Author: Mikoron * ♡mikoiwate_351♡
*/

#include<stdio.h>


short solve(short p, short t);
short n, q, A[2000], Mi[2000];

int main(void) {
        short i;

        scanf("%hd", &n);
        for(i = 0; i < n; i++) {
                scanf("%hd", &A[i]);
        }

        scanf("%hd", &q);
        for(i = 0; i < q; i++) {
                scanf("%hd", &Mi[i]);
        }

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

        return 0;
}

short solve(short p, short t) {
        short res;

        //printf("before p = %hd : t = %hd : A[p] = %hd\n", p, t, A[p]);
        //printf("t - A[p] = %hd \n" ,t-A[p]);

        if(t == 0) {
                //printf("yes\n");
            return 1;
        }
        if(p > n) {
                //printf("no\n");
                return 0;
        }

        //printf("p = %hd : t = %hd : A[p] = %hd\n", p, t, A[p]);
        res = (solve(p + 1, t) || solve(p + 1, t - A[p]));
        return res;
}

