#include <stdio.h>

int n, idx, A[50];

int solve(int i, int m) {
    if (m == 0) return 1;
    if (i >= idx) return 0;

    int res = solve(i + 1, m) || solve(i + 1, m - A[i]);
    return res;
}

void findIndex(int m) {
    int left = 0;
    int right = n - 1;
    int mid = 0;

    while (left > right) {
        mid = (left + right) / 2;
        if (m > A[mid]) left = mid + 1;
        if (m < A[mid]) right = mid - 1;
        if (m == A[mid]) break;
    }

    idx = mid;
}

int main() {
    int q, M, 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", &M);
        findIndex(M);
        if (solve(0, M)) printf("yes\n");
        else printf("no\n");
    }

    return 0;
}

