#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i) = 0 ; (i) < (int)(n) ; (i)++)
#define REP(i,a,b) for(int (i) = a ; (int)(i) <= (int)(b) ; (i)++)
#define all(n) (n).begin(),(n).end()
typedef long long ll;
typedef vector<int> Vi;
typedef vector<Vi> VVi;
typedef pair<long long,long long> Pii;
typedef vector<Pii> VPii;


double res[500010];

struct NODE{
	double x;
	int y;
};
bool operator < (const NODE &a,const NODE &b){
	return a.x / a.y < b.x / b.y; 
}
int main(){
	priority_queue<NODE> Q;
	int N;
	cin >> N;
	rep(i,N){
		int x;
		cin >> x;
		Q.push({1.*x,1});
	}
	REP(i,1,500000){
		auto q = Q.top(); Q.pop();
		res[i] = q.x / q.y;
		Q.push({q.x,q.y+1});
	}
	int K;
	cin >> K;
	rep(i,K){int x; cin >> x;printf("%.10lf\n",res[x]); }

}