#include <stdio.h>

int n, A[20], q, m[200];
int solve(int i, int m)
{
    if (m == 0)
        return 1;
    if (i >= n)
        return 0;
    return solve(i + 1, m) || solve(i + 1, m - A[i]);
}

int main(void)
{
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &A[i]);
    }
    scanf("%d", &q);
    for (int i = 0; i < q; i++)
    {
        scanf("%d", &m[i]);
        if (solve(0, m[i]))
            printf("yes\n");
        else
            printf("no\n");
    }

    return 0;
}
