#include <bits/stdc++.h>
using namespace std;
int n;
int a[1000100];
double ans[1000100];
int len[1000100];
int main(int argc, char const *argv[]) {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  int pos = 0;
  for (int i = 1; i <= n; i++) {
    ans[++pos] = a[i];
    len[pos] = 1;
    while (ans[pos - 1] > ans[pos]) {
      ans[pos - 1] = (ans[pos - 1] * len[pos - 1] + ans[pos] * len[pos]) /
                     (len[pos] + len[pos - 1]);
      len[pos - 1] += len[pos];
      pos--;
    }
  }
  for (int i = 1; i <= pos; i++) {
    for (int j = 1; j <= len[i]; j++) {
      printf("%.9f\n", ans[i]);
    }
  }
  return 0;
}
