#include <stdio.h>
#include <math.h>

int judge(int *L, int idx, int m){
    int i;
    for (i = 0; i < idx; i++)
    {
        if (L[i] == m) return 1;
    }
    return 0;
}

int main(void){
    // Your code here!
    int i, j, n, A[20], q, m, L[1500000], idx;
    long x, temp;
    double xx;
    scanf("%d", &n);
    for (i = 0; i < n; i++) scanf("%d", &A[i]);
    // x = 2 ^ n;
    xx = pow(2.0, (double)n);
    x = (long)xx;
    idx = 0;
    for (i = 0; i < x; i++)
    {
        temp = 0;
        for (j = 0; j < n; j++)
        {
            if (i & (1 << j)) temp += A[j];
        }
        L[idx] = temp;
        L[idx + 1] = -1;
        idx++;
    }
    /*
    printf("x = %d\n", x);
    for (i = 0; i < idx; i++) printf("%d ", L[i]);
    printf("\n");
    */
    scanf("%d", &q);
    for (i = 0; i < q; i++)
    {
        scanf("%d", &m);
        if (judge(L, idx, m) == 1) printf("yes\n");
        else printf("no\n");
    }
    return 0;
}
