import java.math.*;
import java.util.*;
class Pare implements Comparable{
	int moto;
	int kaisuu;
	double now;
	Pare(int x,int y){
		moto = x;
		kaisuu=y;
		now = x;
	}
	@Override
	public int compareTo(Object arg0) {
		// TODO Auto-generated method stub
		Pare o = (Pare)arg0;
		if(this.now<o.now) return 1;
		else if(this.now>o.now) return -1;
		else return 0;
	}
}
class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        PriorityQueue<Pare> que = new PriorityQueue<>();
        for(int i=0;i<n;i++){
        	int a = sc.nextInt();
        	que.add(new Pare(a,1));
        }
        double[] ans = new double[500001];
        for(int i=1;i<500001;i++){
        	Pare temp = que.poll();
        	ans[i]=temp.now;
        	temp.kaisuu++;
        	temp.now=1.0*temp.moto/temp.kaisuu;
        	que.offer(temp);
        }
        int aa = sc.nextInt();
        for(int i=0;i<aa;i++){
        	int tt = sc.nextInt();
        	System.out.println(ans[tt]);
        }
        
    }
}