#include <stdio.h>

static int n;
static int A[20];

int solve(int p, int t)
{
    int a, b;
    if(t == 0) {
        return 1;
    }
    if(p >= n) {
        return 0;
    }
    if(solve(p+1, t-A[p]) == 1) {
        return 1;
    }
    if(solve(p+1, t) == 1) {
        return 1;
    }
    return 0;
}

int main()
{
    int q;
    int m;

    int i, j, k;
    int pattern;
    int sum;
    int flag;
    int max;

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

    scanf("%d", &q);
    for(i = 0; i < q; i++) {
        scanf("%d", &m);

        if(solve(0, m) == 1) {
            printf("yes\n");
        } else {
            printf("no\n");
        }
    }

    return 0;
}
