#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <sstream>
#include <functional>
#include <ctime>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n)  FOR(i,0,n)
#define CLEAR(d) memset((d), 0, (sizeof((d))))
#define ALL(c) (c).begin(), (c).end()
#define ABS(x) ((x < 0) ? -(x) : (x))
#define SORT(x) sort((x).begin(), (x).end())
#define RSORT(x) sort((x).begin(), (x).end(), greater<int>() )
#define SIZE(a) ((int)((a).size()))
#define MAX3(a, b, c) (max(max((a), (b)), (c)))
#define MIN3(a, b, c) (min(min((a), (b)), (c)))
#define MOD 1000000007
#define EPS 1e-5
#define PI  (acos(-1))
#define INF 10000000
//===================================================
typedef pair<double, int> DIP;
typedef pair<double, DIP> DPP;
double ans[500001];
int main()
{
    int n, q, k;
    double l;
    priority_queue<DPP> que;
    cin >> n;
    REP(i, n) {
        cin >> l;
        que.push(DPP(l, DIP(l, 1)));
    }
    REP(i, 500000) {
        ans[i + 1] = que.top().first;
        double b_l = que.top().second.first;
        int d_n = que.top().second.second + 1;
        double n_l = b_l / d_n;
        que.push(DPP(n_l, DIP(b_l, d_n)));
        que.pop();
    }
    cin >> q;
    REP(i, q) {
        cin >> k;
        printf("%.10f\n", ans[k]);
    }
    return 0;
}