// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

double dp[500001];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<ll> l(n);
  cin >> l;
  priority_queue<pair<double, int>> pq;
  for(int i = 0; i < n; i++)pq.push(mk(l[i], i));
  for(int i = 1; i <= 500000; i++){
    auto p = pq.top(); pq.pop();
    dp[i] = p.first;
    double tmp = l[p.second] / p.first;
    tmp += 1.;
    pq.push(mk(l[p.second] / tmp, p.second));
  }
  int q;
  cin >> q;
  cout << setprecision(20);
  rep(i_, q){
    int k;
    cin >> k;
    cout << dp[k] << endl;
  }
	return 0;
}