#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double lb;
typedef pair<double, int> P;
typedef pair<double, P> PP;
typedef complex<double> comp;
typedef vector< vector<lb> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n, q;
double l[100010];
int k[500010];

void solve() {
    priority_queue<PP> que;
    for (int i = 0; i < n; i++) {
        que.push(PP(l[i], P(l[i], 1)));
    }

    double res[500001];
    for (int i = 1; i <= 500000; i++) {
        PP p = que.top(); que.pop();
        res[i] = p.first;
        p.first = p.second.first / (p.second.second + 1);
        p.second.second++;
        que.push(p);
    }
    
    for (int i = 0; i < q; i++)
        cout << res[k[i]] << endl;
}

void input() {
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> l[i];
    cin >> q;
    for (int i = 0; i < q; i++)
        cin >> k[i];
}

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

    input();
    solve();
}