#include <bits/stdc++.h>
using namespace std;
#pragma optimise("-O3")
template <int D, typename T>
struct Vec : public vector<Vec<D - 1, T>> {
  static_assert(D >= 1, "Vector dimension must be greater than zero!");
  template <typename... Args>
  Vec(int n = 0, Args... args)
      : vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) {}
};
template <typename T>
struct Vec<1, T> : public vector<T> {
  Vec(int n = 0, const T& val = T()) : vector<T>(n, val) {}
};
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  if (y == 0) return 1;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int modinv(long long int a, long long int p) {
  return power(a, p - 2, p);
}
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1},
          dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
template <class T>
bool ckmin(T& a, T& b) {
  bool B = a > b;
  a = min(a, b);
  return B;
}
template <class T>
bool ckmax(T& a, T& b) {
  bool B = a < b;
  a = max(a, b);
  return B;
}
long long int n;
vector<double> a, avg;
void solve() {
  scanf("%d", &n);
  avg.resize(n + 1);
  a.resize(n + 1);
  for (long long int i = 1; i <= n; i += 1) {
    long long int x;
    scanf("%d", &x);
    avg[i] = x;
  }
  stack<pair<double, long long int>> stk;
  stk.push({avg[1], 1});
  for (long long int i = 2; i <= n; i += 1) {
    long long int curSize = 1;
    double val = avg[i];
    while (stk.size() and val < stk.top().first) {
      pair<double, long long int> p = stk.top();
      stk.pop();
      val = val * curSize + p.first * p.second;
      curSize += p.second;
      val /= curSize;
    }
    stk.push({val, curSize});
  }
  long long int idx = n;
  while (stk.size()) {
    pair<double, long long int> p = stk.top();
    for (long long int i = idx; i >= idx - p.second + 1; i--) {
      avg[i] = p.first;
    }
    idx -= p.second;
    stk.pop();
  }
  for (long long int i = 1; i <= n; i += 1) {
    printf("%.10f\n", avg[i]);
  }
  return;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cout << fixed << setprecision(12);
  int T = 1;
  for (long long int c = 0; c < T; c++) {
    solve();
  }
  return 0;
}
