#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N;
	scanf("%d", &N);
	vector<int> L(N);
	rep(i, N) scanf("%d", &L[i]);
	const int MaxK = 500000;
	vector<double> ans(MaxK+1);
	vector<double> inv(MaxK+1);
	priority_queue<tuple<double,int,int> > q;
	rep(i, N) q.push(make_tuple(L[i] * 1., L[i], 1));
	rer(k, 1, MaxK) {
		int l, n;
		tie(ans[k], l, n) = q.top(); q.pop();
		double &v = inv[n];
		if(v == 0) v = 1. / (n + 1);
		q.push(make_tuple(l * v, l, n + 1));
	}
	int Q;
	scanf("%d", &Q);
	rep(ii, Q) {
		int K;
		scanf("%d", &K);
		printf("%.10f\n", ans[K]);
	}
	return 0;
}