#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long longinf = 1LL << 60;
const long long mod = 1e9 + 7;
const long double eps = 1e-10;
template <typename T1, typename T2>
inline void chmin(T1 &a, T2 b) {
  if (a > b) a = b;
}
template <typename T1, typename T2>
inline void chmax(T1 &a, T2 b) {
  if (a < b) a = b;
}
void solve() {
  int n;
  cin >> n;
  vector<long long> A(n);
  for (int i = (int)(0); i < (int)(n); i++) cin >> A[i];
  vector<long long> sum(n + 1);
  for (int i = (int)(0); i < (int)(n); i++) sum[i + 1] = sum[i] + A[i];
  deque<pair<long long, int>> q;
  for (int i = (int)(0); i < (int)(n); i++) {
    q.push_back({A[i], 1});
    while (q.size() >= 2) {
      auto p1 = *q.rbegin();
      auto p2 = *(++q.rbegin());
      if (p1.first * p2.second <= p2.first * p1.second) {
        q.pop_back();
        q.pop_back();
        q.push_back({p1.first + p2.first, p1.second + p2.second});
      } else {
        break;
      }
    }
  }
  vector<long double> ans(n);
  {
    int i = 0;
    while (!q.empty()) {
      long long sum = q.front().first;
      int cnt = q.front().second;
      q.pop_front();
      for (int j = (int)(0); j < (int)(cnt); j++)
        ans[i++] = (long double)sum / cnt;
    }
  }
  cout << fixed << setprecision(15);
  for (int i = (int)(0); i < (int)(n); i++) cout << ans[i] << '\n';
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int T = 1;
  while (T--) solve();
  return 0;
}
