#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
double eps = 2e-9;
int n;
double a[N];
vector<double> v[N];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lf", &a[i]);
    v[i].push_back(a[i]);
  }
  int Len = 0, p = 0, t = 0, now = n;
  vector<double> ans;
  while (p <= n) {
    t++;
    p = 0;
    int flag = 0;
    for (int i = 1; i <= now; i++) {
      double sum = 0;
      for (double x : v[i]) sum += x;
      int sz = v[i].size();
      for (int j = 0; j < sz; j++) {
        a[++p] = 1.0 * sum / sz;
        if (a[p - 1] - a[p] >= eps) flag = 1;
      }
      v[i].clear();
    }
    if (!flag) break;
    int nxt = 1;
    v[1].push_back(a[1]);
    for (int i = 2; i <= n; i++) {
      if (a[i] - v[nxt].back() >= eps) nxt++;
      v[nxt].push_back(a[i]);
    }
    now = nxt;
  }
  for (int i = 1; i <= n; i++) printf("%.10f\n", a[i]);
  return 0;
}
