#include <bits/stdc++.h>
using namespace std;
string to_string(long long x) {
  string s;
  bool neg = x < 0;
  x = abs(x);
  do {
    s += char('0' + x % 10);
    x /= 10;
  } while (x != 0);
  if (neg) s += '-';
  reverse(s.begin(), s.end());
  return s;
}
long long powmod(long long a, long long b, long long mod) {
  if (b == 0 || a == 1) return mod == 1 ? 0 : 1;
  if (b % 2 == 0) {
    long long k = powmod(a, b / 2, mod);
    return (k * k) % mod;
  } else {
    long long k = powmod(a, b / 2, mod);
    return ((k * k) % mod * a) % mod;
  }
}
long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
bool is_prime(long long n) {
  long long bound = sqrt(n);
  long long d = 2;
  while (d <= bound && n % d != 0) ++d;
  return d * d > n;
}
const int MOD = 1000000007;
const int MOD2 = 1000000009;
const int BASE = 257;
const int INF = 1000000050;
const long long INF2 = 1e15 + 228;
const int MX = 100010;
const double EPS = 1e-9;
const int DI[]{1, -1, 0, 0};
const int DJ[]{0, 0, 1, -1};
mt19937 rnd;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout.precision(15);
  int n;
  cin >> n;
  vector<long long> arr(n + 1);
  for (int i = 1; i < n + 1; i++) cin >> arr[i];
  partial_sum(arr.begin(), arr.end(), arr.begin());
  vector<pair<int, int>> hull;
  for (int i = 1; i < n + 1; i++) {
    while (hull.size() >= 1) {
      int l1 = hull.back().second - hull.back().first + 1;
      int l2 = i - hull.back().first + 1;
      long long s1 = arr[hull.back().second] - arr[hull.back().first - 1];
      long long s2 = arr[i] - arr[hull.back().first - 1];
      if (s2 * l1 < s1 * l2)
        hull.pop_back();
      else
        break;
    }
    hull.push_back({(hull.empty() ? 1 : hull.back().second + 1), i});
  }
  cout << fixed << setprecision(15);
  for (auto& x : hull) {
    double val =
        double(arr[x.second] - arr[x.first - 1]) / (x.second - x.first + 1);
    for (int i = x.first; i < x.second + 1; i++) cout << val << '\n';
  }
}
