#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
int n, a[maxn], len[maxn];
double ans[maxn];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    ans[++cnt] = a[i];
    len[cnt] = 1;
    while (cnt > 1 && ans[cnt - 1] > ans[cnt]) {
      ans[cnt - 1] = (ans[cnt - 1] * len[cnt - 1] + ans[cnt] * len[cnt]) /
                     (len[cnt] + len[cnt - 1]);
      len[cnt - 1] += len[cnt];
      cnt--;
    }
  }
  for (int i = 1; i <= cnt; i++) {
    for (int j = 1; j <= len[i]; j++) {
      printf("%.12lf\n", ans[i]);
    }
  }
}
