#include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <limits>
#include <cmath>
#include <cstdio>
#include <iomanip>

using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define inf INT_MAX/3
#define INF INT_MAX/3
#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define SET(a,c) memset(a,c,sizeof a)
#define CLR(a) memset(a,0,sizeof a)
#define pii pair<int,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define MIN(a,b) (a>b?b:a)
#define MAX(a,b) (a>b?a:b)
#define pi 2*acos(0.0)
#define INFILE() freopen("in0.txt","r",stdin)
#define OUTFILE()freopen("out0.txt","w",stdout)
#define in scanf
#define out printf
#define LL long long
#define ll long long
#define ULL unsigned long long
#define eps 1e-14
#define FST first
#define SEC second

double k[500001] = {};
int cnt[100000] = {};

int main(void) {
	priority_queue<pair<double, int> > l;
	int N;
	vector<int> L;
	int Q;
	vector<int> K;
	int maxk = 0;

	cin >> N;
	REP(i, N) {
		double a; cin >> a;
		L.push_back(a);
		l.push(MP(a, 1));
	}
	cin >> Q;
	REP(i, Q) {
		int a; cin >> a;
		K.push_back(a);
		if (maxk < a) maxk = a;
	}

	for (int i = 1; i <= maxk; ++i) {
		auto a = l.top(); l.pop();
		k[i] = a.first;
		a.first = a.first*a.second;
		a.second++;
		l.push(MP(a.first/a.second, a.second));
	}

	cout << fixed << setprecision(15);
	for (int i = 0; i < Q; ++i) {
		cout << k[K[i]] << endl;
	}

	return 0;
}