#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> len(n);
    for(int i=0; i<n; ++i)
        cin >> len[i];

    priority_queue<pair<double, int> > pq;
    for(int i=0; i<n; ++i)
        pq.push(make_pair(len[i], i));
    
    vector<int> cnt(n, 0);
    vector<double> ret(500001);
    for(int i=1; i<=500000; ++i){
        ret[i] = pq.top().first;
        int j = pq.top().second;
        pq.pop();

        ++ cnt[j];
        pq.push(make_pair(len[j] / (cnt[j] + 1.0), j));
    }

    int q;
    cin >> q;
    while(--q >= 0){
        int k;
        cin >> k;
        printf("%.10f\n", ret[k]);
    }

    return 0;
}