#include <bits/stdc++.h>
using namespace std;
int T, n;
const int maxn = 1e6 + 5;
int a[maxn];
double pre[maxn];
int top;
double val[maxn];
pair<int, int> stk[maxn];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = (1); i < (n + 1); ++i) cin >> a[i];
  pre[0] = 0.0;
  for (int i = (1); i < (n + 1); ++i) pre[i] = pre[i - 1] + a[i];
  top = 0;
  for (int i = (1); i < (n + 1); ++i) {
    double cur = a[i];
    pair<int, int> seg = make_pair(i, i);
    while (top && cur < val[top]) {
      cur = (pre[i] - pre[stk[top].first - 1]) / (i - stk[top].first + 1);
      --top;
    }
    ++top;
    val[top] = cur;
    stk[top] = make_pair((top == 1 ? 1 : stk[top - 1].second + 1), i);
  }
  for (int i = (1); i < (top + 1); ++i) {
    for (int j = (stk[i].first); j < (stk[i].second + 1); ++j)
      cout << std::setprecision(10) << val[i] << " \n"[j == n];
  }
  return 0;
}
