#include <stdio.h>


int solve(int a[], int k, int m, int n) {
    int res;
    if (m == 0) return 1;
    if (k >= n) return 0;
    res = solve (a, k + 1, m, n) || solve(a, k + 1, m - a[k], n);
    return res;
}

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