#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define chmin(a, b) ((b) < a && (a = (b), true))
#define chmax(a, b) (a < (b) && (a = (b), true))
using namespace std;
typedef long long ll;

int main() {
	int N;
	cin >> N;
	vector<ll> L(N);
	rep (i, N) scanf("%lld", &L[i]);
	typedef tuple<double, int, int> P; // len, div, id
	priority_queue<P> q;
	rep (i, N) q.emplace(L[i], 1, i);
	vector<double> ans(505050);
	rep (i, 505050) {
		double len;
		int d, id;
		tie(len, d, id) = q.top(); q.pop();
		ans[i] = len;
		q.emplace((double)L[id] / (d + 1), d + 1, id);
	}
	int Q;
	cin >> Q;
	rep (i, Q) {
		int K;
		scanf("%d", &K);
		printf("%.20f\n", ans[K - 1]);
	}
	return 0;
}