#include<stdio.h>
int A[2000],M[2000],i,q;
void solve(int,int)

void solve(p,t){

if(t-A[p]==0){
printf("yes\n");
return 0;
}
solve(p+1,t-A[p]);

solve(p+1,t);

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