#include <stdio.h>

int n, q, m;
int a[20], flgs[2001];

int solve(int i, int remain) {
    if (remain == 0) return 1;
    else if (i >= n) return 0;
    
    return solve(i+1, remain-a[i]) || solve(i+1, remain);
}

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);
        if (solve(0, m)) printf("yes\n");
        else printf("no\n");
    }
}

