#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long r = 1;
  while (b != 0) {
    if (b % 2 != 0) {
      r = r * a;
      r %= 998244353ll;
    }
    a = a * a;
    a = a % 998244353ll;
    b = b / 2;
  }
  return r;
}
void solve() {
  long long n;
  cin >> n;
  long long a[n + 1];
  for (long long i = (1); i <= (n); i++) {
    cin >> a[i];
  }
  stack<pair<long long, long long> > k;
  k.push(make_pair(a[1], 1));
  for (long long i = (2); i <= (n); i++) {
    long long q = a[i];
    pair<long long, long long> pr;
    pr.first = q;
    pr.second = 1;
    while (!k.empty()) {
      pair<long long, long long> s = k.top();
      if (s.first * pr.second >= pr.first * s.second) {
        k.pop();
        pr.first = pr.first + s.first;
        pr.second = pr.second + s.second;
      } else {
        break;
      }
    }
    k.push(pr);
  }
  cout << fixed << setprecision(10);
  vector<pair<long long, long long> > ans;
  while (!k.empty()) {
    pair<long long, long long> q = k.top();
    k.pop();
    ans.push_back(q);
  }
  reverse(ans.begin(), ans.end());
  for (long long j = (0); j <= (ans.size() - 1ll); j++) {
    pair<long long, long long> q = ans[j];
    long double m = (double)q.first / (double)q.second;
    for (long long i = (1); i <= (q.second); i++) {
      cout << m << " ";
    }
  }
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
