#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int n;
pair<long long, long long> p[maxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> p[i].first;
    p[i].second = 1;
  }
  long long a, b;
  bool flag = true;
  while (flag) {
    flag = false;
    int i = 0;
    tie(a, b) = p[0];
    while (i + b < n) {
      long long at, bt;
      tie(at, bt) = p[i + b];
      if (at * b < a * bt) {
        a += at;
        b += bt;
        flag = true;
      } else {
        for (int k = i; k < i + b; ++k) p[k] = make_pair(a, b);
        i += b;
        a = at;
        b = bt;
      }
    }
    for (int k = i; k < n; ++k) p[k] = make_pair(a, b);
  }
  for (int i = 0; i < n; ++i)
    cout << fixed << setprecision(9) << double(p[i].first) / double(p[i].second)
         << '\n';
  return 0;
}
