//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int N = 1e5+10;
const int K = 5e5+10;

//head

int n;
int l[N];
int q;
ld k[K];

PQ<pair<ld, int>> pq;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(20);
  
  cin >> n;
  rep(i, n) cin >> l[i];
  rep(i, n) pq.emplace(l[i], 1);
  cin >> q;

  rep(i, K) {
    auto now = pq.top();
    pq.pop();
    k[i] = now.first;
    pq.emplace(now.first*now.second/(now.second+1), now.second+1);
  }

  while(q--) {
    int u;
    cin >> u;
    cout << k[u-1] << '\n';
  }
  
}