#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

const int MA = 100001, GOMA = 5 * MA;
int N, L[MA], Q, K, A[GOMA];
double ans[GOMA];

int main(){
    cin >> N;
    rep(i, N)scanf("%d", &L[i]);
    priority_queue<pair<double,int> > q;
    rep(i, N)q.push(mp(L[i], i)), A[i] = 1;
    FOR(i, 1, GOMA){
        double x;
        int k;
        tie(x, k) = q.top(); q.pop();
        ans[i] = x;
        q.push(mp((double)L[k] / ++A[k], k));
    }
    cin >> Q;
    while(Q--){
        scanf("%d", &K);
        printf("%0.15f\n", ans[K]);
    }
}