#include <bits/stdc++.h>
using namespace std;
double cross_product(pair<double, double> O, pair<double, double> A,
                     pair<double, double> B) {
  return (A.first - O.first) * (B.second - O.second) -
         (A.second - O.second) * (B.first - O.first);
}
vector<pair<double, double> > convex_hull(vector<pair<double, double> > A) {
  int n = A.size(), k = 0;
  if (n <= 3) return A;
  vector<pair<double, double> > ans(2 * n);
  sort(A.begin(), A.end());
  for (int i = 0; i < n; ++i) {
    while (k >= 2 && cross_product(ans[k - 2], ans[k - 1], A[i]) <= 0) k--;
    ans[k++] = A[i];
  }
  ans.resize(k);
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  vector<pair<double, double> > su(n + 1);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    su[i + 1].second = su[i].second + a[i];
    su[i + 1].first = i + 1;
  }
  su.push_back(su.back());
  auto hull = convex_hull(su);
  int cur = 0;
  for (int i = 0; i < n; i++) {
    while (cur + 2 < hull.size() and hull[cur + 1].second <= su[i].second)
      cur++;
    cout << fixed << setprecision(11)
         << (hull[cur + 1].second - hull[cur].second) /
                (hull[cur + 1].first - hull[cur].first)
         << '\n';
  }
  return 0;
}
