#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
long long gcd(long long x, long long y) {
  if (y == 0)
    return x;
  else
    return gcd(y, x % y);
}
long long ksm(long long a, long long b) {
  long long r = 1;
  while (b) {
    if (b & 1) r = (r * a) % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return r;
}
void exgcd(long long a, long long b, long long& d, long long& x, long long& y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    exgcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
long long inv(long long a, long long p) {
  long long d, x, y;
  exgcd(a, p, d, x, y);
  return d == 1 ? (x + p) % p : -1;
}
inline int read() {
  char c = getchar();
  int x = 0, f = 1;
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x * f;
}
const int maxn = 1e6 + 100;
long long st[maxn], top = 1, n, a[maxn], s[maxn];
int main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read(), s[i] = s[i - 1] + a[i];
  for (int i = 1; i <= n; i++) {
    while (top > 1 && 1ll * (s[i] - s[st[top]]) * (i - st[top - 1]) <=
                          1ll * (s[i] - s[st[top - 1]]) * (i - st[top]))
      top--;
    st[++top] = i;
  }
  for (int i = 2; i <= top; i++) {
    double res = 1.0 * (s[st[i]] - s[st[i - 1]]) / (st[i] - st[i - 1]);
    for (int j = st[i - 1] + 1; j <= st[i]; j++) printf("%.9lf\n", res);
  }
  return 0;
}
