#include <bits/stdc++.h>
using namespace std;
const int inf = 10000000;
const int maxn = 1000000 + 7;
int n;
double a[maxn], s[maxn];
int top, q[maxn];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lf", &a[i]);
    s[i] = s[i - 1] + a[i];
  }
  for (int i = n; i >= 1; i--) {
    q[++top] = i;
    while (top >= 2 &&
           (s[q[top]] - s[i - 1]) / (q[top] - (i - 1)) >
               (s[q[top - 1]] - s[q[top]]) / (q[top - 1] - q[top])) {
      top--;
    }
  }
  q[top + 1] = 0;
  for (int i = top; i >= 1; i--) {
    double avg = (s[q[i]] - s[q[i + 1]]) / (q[i] - q[i + 1]);
    for (int j = q[i + 1] + 1; j <= q[i]; j++) printf("%.10f\n", avg);
  }
  return 0;
}
