#include <bits/stdc++.h>
using namespace std;
long long n, sz, a[1000005], s[1000005];
bool ch(long long p1, long long q1, long long p2, long long q2) {
  return p1 * q2 > q1 * p2;
}
int main() {
  long long i, j, t, x;
  cin >> n;
  cin >> t;
  a[0] = t;
  s[0] = 1;
  sz = 0;
  for (i = 1; i < n; i++) {
    scanf("%I64d", &x);
    a[sz + 1] = x;
    s[sz + 1] = 1;
    for (j = sz; j >= 0; j--) {
      if (!ch(a[j], s[j], a[j] + a[j + 1], s[j] + s[j + 1])) break;
      a[j] += a[j + 1];
      s[j] += s[j + 1];
      a[j + 1] = s[j + 1] = 0;
    }
    sz = j + 1;
  }
  for (i = 0; i <= sz; i++) {
    double ans;
    ans = (double)(a[i]) / s[i];
    for (j = 0; j < s[i]; j++) {
      printf("%.15f\n", ans);
    }
  }
  return 0;
}
