#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
long long a[maxn], p[maxn], top;
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 1, x; i <= n; ++i) {
    cin >> x;
    a[i] = a[i - 1] + x;
  }
  for (int i = 1; i <= n; ++i) {
    while (top && 1.0 * (a[p[top]] - a[p[top - 1]]) / (p[top] - p[top - 1]) >
                      1.0 * (a[i] - a[p[top - 1]]) / (i - p[top - 1]))
      top--;
    p[++top] = i;
  }
  for (int i = 1; i <= top; ++i) {
    double x = 1.0 * (a[p[i]] - a[p[i - 1]]) / (p[i] - p[i - 1]);
    for (int j = p[i - 1]; j < p[i]; ++j) printf("%.9f\n", x);
  }
  return 0;
}
