#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
int n, m, k, t, T, x, y, top;
int a[N];
long long cnt[N], sum[N], tot, now;
int read() {
  int y = 0, flag = 1;
  char ch = getchar();
  while ((ch > '9' || ch < '0') && ch != '-') ch = getchar();
  if (ch == '-') flag = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') y = y * 10 + ch - '0', ch = getchar();
  return y * flag;
}
void solve() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int i = 1; i <= n; i++) {
    now = a[i], tot = 1;
    while (top && (double)(now + sum[top]) / (tot + cnt[top]) <=
                      (double)sum[top] / cnt[top]) {
      now += sum[top];
      tot += cnt[top];
      top--;
    }
    sum[++top] = now;
    cnt[top] = tot;
  }
  for (int i = 1; i <= top; i++) {
    double ans = (double)sum[i] / cnt[i];
    for (int j = 1; j <= cnt[i]; j++) printf("%.9f\n", ans);
  }
}
int main() {
  solve();
  return 0;
}
