#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
double a[N], b[N], c[N];
int len[N], sz[N];
int main() {
  int n, cnt = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lf", &a[i]);
  for (int i = 1, j; i <= n; i = j) {
    j = i;
    while (j <= n && a[i] == a[j]) {
      j++;
    }
    c[cnt++] = a[i];
    sz[cnt - 1] = j - i;
  }
  int p = 0;
  for (int i = 0; i < cnt; i++) {
    b[++p] = c[i];
    len[p] = sz[i];
    while (p > 1 && b[p - 1] >= b[p]) {
      b[p - 1] =
          (b[p] * len[p] + b[p - 1] * len[p - 1]) / (len[p] + len[p - 1]);
      len[p - 1] = len[p] + len[p - 1];
      p--;
    }
  }
  for (int i = 1; i <= p; i++)
    for (int j = 1; j <= len[i]; j++) printf("%.10f\n", b[i]);
  return 0;
}
