#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
using ll = long long;
ll a[N];
int top;
int s[N];
const double eps = 1e-12;
double cal(int l, int r) { return (double)(a[r] - a[l - 1]) / (r - l + 1); }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%I64d", &a[i]), a[i] += a[i - 1];
  s[0] = 0;
  for (int i = 1; i <= n; ++i) {
    while (top && cal(s[top - 1] + 1, s[top]) - cal(s[top - 1] + 1, i) >= eps)
      --top;
    s[++top] = i;
  }
  for (int i = 1; i <= top; ++i) {
    for (int j = s[i - 1] + 1; j <= s[i]; ++j) {
      printf("%.12f%c", cal(s[i - 1] + 1, s[i]), j == n ? '\n' : ' ');
    }
  }
}
