#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

void solve() {
    int n;
    cin >> n;
    using D = long double;
    using T = tuple<D, D, int>;
    priority_queue<T> q;
    rep(i, n) {
        D d;
        cin >> d;
        q.emplace(d, d, 1);
    }
    const int ma = (int)5e5 + 10;
    vector<D> ans(ma);
    rep(i, ma) {
        auto [x, y, z] = q.top();
        q.pop();
        ans[i] = x;
        q.emplace(y / (z + 1), y, z + 1);
    }
    cout << fixed << setprecision(15);
    int m;
    cin >> m;
    rep(i, m) {
        int k;
        cin >> k;
        cout << ans[k - 1] << "\n";
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}