#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
long long a[maxn], p[maxn], q[maxn];
long long t, c, s;
int main() {
  long long n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    s = a[i];
    c = 1;
    while (t && p[t] * c >= s * q[t]) s += p[t], c += q[t--];
    p[++t] = s, q[t] = c;
  }
  for (int i = 1; i <= t; i++)
    for (int j = 1; j <= q[i]; j++) printf("%.9lf\n", p[i] * 1.0 / q[i]);
  return 0;
}
