#include<stdio.h>
#define N 2000
    int A[N],n;
int isSolved(int i,int k){
    int res;
    if(k==0) return 1;
    if(i>=n) return 0;
    res = isSolved(i+1,k) || isSolved(i+1,k-A[i]);
    return res;
}
int main(){
    int i,q,k;
    scanf("%d",&n);
    for(i=0;i<n;i++) scanf("%d",&A[i]);
    
    scanf("%d",&q);
    for(i=0;i<q;i++){
        scanf("%d",&k);
        if(isSolved(0,k)==1) printf("yes\n");
        else printf("no\n");
    }
    return 0;
}
