#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int block[maxn];
double ans[maxn];
int main() {
  int n, v, len = 0;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &v);
    ans[++len] = v;
    block[len] = 1;
    while (ans[len] <= ans[len - 1]) {
      if (ans[len] < ans[len - 1])
        ans[len - 1] = (ans[len - 1] * block[len - 1] + ans[len] * block[len]) /
                       (block[len - 1] + block[len]);
      block[len - 1] += block[len];
      --len;
    }
  }
  for (int i = 1; i <= len; i++)
    for (int j = 0; j < block[i]; j++) printf("%.10f\n", ans[i]);
  return 0;
}
