#include <stdio.h>
#include <math.h>
#define M 2000

int solve(int , int);
int A[M],n;

int main(){
    int fact,i,q;

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

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

