#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int n;
  cin >> n;
  vector<ll> sum(n + 1);
  for (int i = 1; i <= n; i++) {
    ll a;
    cin >> a;
    sum[i] = sum[i - 1] + a;
  }
  vector<pair<int, double>> ans;
  ans.reserve(n);
  for (int i = 1; i <= n; i++) {
    double aver = sum[i] - sum[i - 1];
    int len = 1;
    for (auto it = ans.rbegin(); it != ans.rend() && aver < it->second; it++) {
      aver = (len * aver + it->first * it->second) / (len + it->first);
      len += it->first;
      ans.pop_back();
    }
    ans.emplace_back(len, aver);
  }
  cout.precision(10);
  for (auto i : ans)
    for (int j = 0; j < i.first; j++) cout << i.second << '\n';
}
