#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 7;
double a[MAXN], q[MAXN], len[MAXN];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    int x;
    cin >> x;
    a[i] = 1.0 * x;
  }
  int p = 0;
  for (int j = 1; j <= n; ++j) {
    q[++p] = a[j];
    len[p] = 1;
    while (p > 1 && q[p] < q[p - 1]) {
      q[p - 1] =
          (q[p] * len[p] + q[p - 1] * len[p - 1]) / (len[p] + len[p - 1]);
      len[p - 1] = len[p - 1] + len[p];
      p--;
    }
  }
  for (int k = 1; k <= p; ++k) {
    for (int i = 0; i < len[k]; ++i) {
      printf("%.9f\n", q[k]);
    }
  }
  return 0;
}
