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