#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;
int r[maxn];
double a[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%lf", &a[i]), r[i] = i;
  a[n + 1] = inf;
  for (int i = n; i >= 1; --i) {
    int j = i + 1, len = 1;
    double all = a[i];
    while (a[j] < a[i]) {
      all += a[j] * (r[j] - j + 1);
      len += r[j] - j + 1;
      a[i] = all / len;
      r[i] = r[j];
      j = r[j] + 1;
    }
  }
  for (int i = 1; i <= n; i = r[i] + 1) {
    for (int j = i; j <= r[i]; ++j) {
      printf("%.9lf\n", a[i]);
    }
  }
  return 0;
}
