#include <bits/stdc++.h>
using namespace std;

int main() {
	int N;
	cin >> N;
	vector<int> L(N);
	for(int i = 0; i < N; ++i) cin >> L[i];
	
	const int Kmax = 505050;
	vector<double> ans(Kmax);
	
	vector<int> cnt(N, 1);
	priority_queue<pair<double, int>> que;
	for(int i = 0; i < N; ++i) que.push({1.0 * L[i] / cnt[i], i});
	
	for(int k = 1; k < Kmax; ++k) {
		auto [val, i] = que.top(); que.pop();
		ans[k] = val;
		cnt[i] += 1;
		que.push({1.0 * L[i] / cnt[i], i});
	}
	
	cout << fixed << setprecision(15);
	
	int Q;
	cin >> Q;
	while(Q--) {
		int K;
		cin >> K;
		
		cout << ans[K] << "\n";
	}
}