#include <stdio.h>

int n;
int A[20];
int q;
int m[200];

int search(int key, int i){
    if(key==0){
        return 1;
    }
    if(i==n || key<0){
        return 0;
    }
    return (search(key-A[i], i+1) || search(key, i+1));
}

int main(void){
    // Your code here!
    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]);
    }
    for(int i=0;i<q;i++){
        //printf("%d %d\n", i, search(m[i], 0));
        if(search(m[i], 0)){
            printf("yes\n");
        }else{
            printf("no\n");
        }
    }
}

