#include <stdio.h>

int A[20+5], n;
int M[200+5], q;

int solve(int, int);

int main()
{
    int 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[i]);
    
    for (i = 0; i < q; i++){
        (solve(0, M[i]))? printf("yes\n") : printf("no\n");
    }
    
    return 0;
}

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

