#include <bits/stdc++.h>
using namespace std;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) _repi(i,0,n)
#define _repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)

const int N = 100010;

int n, L[N], q, k[N];

void input()
{
    cin >> n;
    rep(i, n) cin >> L[i];
    cin >> q;
    rep(i, q) cin >> k[i];
}

double ans[N];

void solve()
{
    vector<pair<int, int>> queries;
    rep(i, q) queries.emplace_back(k[i], i);
    sort(begin(queries), end(queries));
    struct entry {
        int id, num; double len;
        entry(int id, int num, double len) : id(id), num(num), len(len) {}
        bool operator <(const entry& t) const { return len < t.len; }
    };
    priority_queue<entry> que;
    rep(i, n) que.emplace(i, 1, L[i]);
    int i = 0, cnt = 0;
    while (i < q) {
        auto e = que.top();
        que.pop();
        ++cnt;
        while (i < q and queries[i].first <= cnt) {
            ans[queries[i++].second] = e.len;
        }
        que.emplace(e.id, e.num + 1, double(L[e.id]) / (e.num + 1));
    }
    rep(i, q) cout << ans[i] << endl;
}

int main()
{
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(15);

    input();
    solve();
}