#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 5;
long long a[maxn];
vector<pair<long long, int> > s;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  for (int i = 1; i <= n; ++i) {
    long long sum = a[i], cnt = 1;
    while (!s.empty() && s.back().first * cnt >= sum * s.back().second) {
      sum += s.back().first, cnt += s.back().second;
      s.pop_back();
    }
    s.emplace_back(sum, cnt);
  }
  cout << setprecision(9) << fixed;
  for (int i = 0; i < s.size(); ++i) {
    long long cnt = s[i].second;
    double ans = 1.0 * s[i].first / s[i].second;
    for (int j = 1; j <= cnt; ++j) printf("%.9f\n", ans);
  }
  return 0;
}
