#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 50;
long long sum[maxn], cnt[maxn], a[maxn];
int main() {
  int n;
  scanf("%d", &n);
  int t = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    sum[++t] = a[i], cnt[t] = 1;
    while (t > 1 && sum[t] * 1.0 / cnt[t] <= sum[t - 1] * 1.0 / cnt[t - 1]) {
      sum[t - 1] = sum[t - 1] + sum[t];
      cnt[t - 1] = cnt[t - 1] + cnt[t];
      t--;
    }
  }
  for (int i = 1; i <= t; i++) {
    double x = sum[i] * 1.0 / cnt[i];
    for (int j = 1; j <= cnt[i]; j++) printf("%.8f\n", x);
  }
  return 0;
}
