#include <iostream>
#include <queue>
using namespace std;

const int K_MAX = 500010;

double res[K_MAX];
int main(){
    int N;
    cin >> N;
    
    priority_queue<pair<double, int>> Q;
    for(int i=0;i<N;i++){
        int L;
        cin >> L;
        
        Q.push(make_pair(L, 1));
    }
    
    for(int k=1;k<K_MAX;k++){
        auto ps = Q.top(); Q.pop();
        
        double len = ps.first;
        int cut = ps.second;
        
        res[k] = len;
        Q.push(make_pair(len * cut / (cut + 1), cut + 1));
    }
    
    int Qs;
    cin >> Qs;
    
    for(int i=0;i<Qs;i++){
        int K;
        cin >> K;
        
        printf("%.15f\n", res[K]);
    }
    
    return 0;
}