#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int a[N];
long long pref[N];
double ans[N];
pair<double, int> dp[N];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    pref[i] = pref[i - 1] + a[i];
  }
  for (int i = n; i >= 1; i--) {
    dp[i].first = a[i];
    dp[i].second = i;
    for (int j = i; j < n; j++) {
      if ((double)(pref[j] - pref[i - 1]) / (j - i + 1) > dp[j + 1].first) {
        dp[i].second = dp[j + 1].second;
        dp[i].first =
            (double)(pref[dp[i].second] - pref[i - 1]) / (dp[i].second - i + 1);
        j = dp[i].second - 1;
      } else {
        break;
      }
    }
  }
  for (int i = 1; i <= n;) {
    int idx = dp[i].second;
    for (int k = i; k <= idx; k++) {
      printf("%.12f\n", dp[i].first);
    }
    i = idx + 1;
  }
}
