#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstdio>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
typedef long long ll;
using namespace std;
struct rational_t { int p, q; };
bool operator < (rational_t a, rational_t b) { return a.p *(ll) b.q < b.p *(ll) a.q; }
int main() {
    int n; cin >> n;
    vector<int> ls(n); repeat (i,n) cin >> ls[i];
    int q; cin >> q;
    vector<int> k(q); repeat (i,q) cin >> k[i];
    int max_k = *max_element(k.begin(), k.end());
    vector<double> a(max_k+1);
    priority_queue<rational_t> que;
    for (int l : ls) que.push((rational_t) { l, 1 });
    repeat (i,max_k) {
        rational_t r = que.top(); que.pop();
        a[i+1] = r.p /(double) r.q;
        ++ r.q;
        que.push(r);
    }
    repeat (i,q) printf("%.14lf\n", a[k[i]]);
    return 0;
}