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