#include <bits/stdc++.h>
using namespace std;
bool dec(pair<long long, long long> x, pair<long long, long long> y,
         pair<long long, long long> z) {
  return (x.second - y.second) * (y.first - z.first) >
         (y.second - z.second) * (x.first - y.first);
}
int main() {
  int n;
  cin >> n;
  vector<long long> v(n + 1), p(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> v[i];
    p[i] = p[i - 1] + v[i];
  }
  int r = 0;
  vector<int> pt(n);
  for (int i = 1; i <= n; i++) {
    while (r > 0 &&
           dec({pt[r - 1], p[pt[r - 1]]}, {pt[r], p[pt[r]]}, {i, p[i]}))
      r--;
    pt[++r] = i;
  }
  vector<double> ans(n + 1);
  for (int i = 0; i < r; i++) {
    int tl, tr;
    if (i == r - 1)
      tl = pt[i] + 1, tr = n;
    else
      tl = pt[i] + 1, tr = pt[i + 1];
    double sum = p[tr] - p[tl - 1], len = (tr - tl + 1);
    for (int j = tl; j <= tr; j++) {
      ans[j] = sum / len;
    }
  }
  for (int i = 1; i <= n; i++) {
    printf("%.9lf\n", ans[i]);
  }
}
