#include<stdio.h>
int n,A[2000];

/*is it possible to make m by adding A's element whose indexs are more than i*/
int solve(int i,int m){
    if (m==0) return 1;
    if(i>=n) return 0;
    int res=solve(i+1,m)||solve(i+1,m-A[i]);
    return res;
}

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