#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;

int N;
ll nums[100100];
int Q;
pair <ll,int> K[100100];
double ans[100100];

void calc(double lp,double up,int now){

  while(up > lp + 1e-9 && up > lp*(1+1e-9)){
    double mid = (lp + up) / 2;
    double mid_time = 1 / mid;
    ll now_k = 0;
    rep(i,N){
      now_k += (ll) (nums[i] * mid_time);
    }
    if(now_k >= K[now].first){
      lp = mid;
    }else{
      up = mid;
    }
  }
  //DEBUG3(K[now],now,lp);
  ans[K[now].second] = lp;
}

void go(double lp,double up,int start,int end){//[start,end)

  if(end - start == 1){
    //DEBUG4(lp,up,start,end);
    calc(lp,up,start);
    return;
  }else if(end <= start){
    return;
  }
  if(abs(up - lp) < 1e-12){
    return;
  }
  double mid = (lp + up) / 2;
  double mid_time = 1 / mid;
  ll now_k = 0;
  rep(i,N){
    now_k += (ll) (nums[i] * mid_time);
  }

  auto it = lower_bound(K+start,K+end,now_k,[](pair <ll,int> a,ll k){return a.first <= k;});
  //DEBUG4(lp,up,start,end);
  //DEBUG2(now_k,it-K);
  if(it == K+Q){
    go(mid,up,start,end);
  }else{
    go(lp,mid,it-K,end);
    go(mid,up,start,(it-K));
  }
}

int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int a,b;
  cin >> N;
  rep(i,N){
    cin >> nums[i];
  }
  cin >> Q;
  rep(i,Q){
    cin >> K[i].first;
    K[i].second = i;
  }
  sort(K,K+Q);
  go(0,1000000010,0,Q);
  rep(i,Q){
    cout << fixed << setprecision(10) << ans[i] << endl;
  }
  return 0;
}