#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int maxn = (int)1e6 + 10;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const long long mod = (long long)1e9 + 7;
int n, id = 1;
double a[maxn], b[maxn], len[maxn];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    a[i] = x * 1.0;
  }
  for (int i = 1; i <= n; i++, id++) {
    b[id] = a[i];
    len[id] = 1;
    while (id > 1 && b[id] < b[id - 1]) {
      b[id - 1] =
          (b[id] * len[id] + b[id - 1] * len[id - 1]) / (len[id - 1] + len[id]);
      len[id - 1] += len[id];
      id--;
    }
  }
  for (int i = 1; i < id; i++) {
    for (int j = 1; j <= len[i]; j++) {
      printf("%.10lf\n", b[i]);
    }
  }
}
