#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void rd(T &x) {
  char ch;
  x = 0;
  bool fl = false;
  while (!isdigit(ch = getchar())) (ch == '-') && (fl = true);
  for (x = (ch ^ '0'); isdigit(ch = getchar()); x = x * 10 + (ch ^ '0'))
    ;
  (fl == true) && (x = -x);
}
template <class T>
inline void output(T x) {
  if (x / 10) output(x / 10);
  putchar(x % 10 + '0');
}
template <class T>
inline void ot(T x) {
  if (x < 0) putchar('-'), x = -x;
  output(x);
  putchar(' ');
}
template <class T>
inline void prt(T a[], int st, int nd) {
  for (register int i = st; i <= nd; ++i) ot(a[i]);
  putchar('\n');
}
namespace Modulo {
const int mod = 998244353;
inline int ad(int x, int y) { return x + y >= mod ? x + y - mod : x + y; }
inline int sub(int x, int y) { return ad(x, mod - y); }
inline int mul(int x, int y) { return (long long)x * y % mod; }
inline void inc(int &x, int y) { x = ad(x, y); }
inline void inc2(int &x, int y) { x = mul(x, y); }
inline int qm(int x, int y = mod - 2) {
  int ret = 1;
  while (y) {
    if (y & 1) ret = mul(x, ret);
    x = mul(x, x);
    y >>= 1;
  }
  return ret;
}
template <class... Args>
inline int ad(const int a, const int b, const Args &...args) {
  return ad(ad(a, b), args...);
}
template <class... Args>
inline int mul(const int a, const int b, const Args &...args) {
  return mul(mul(a, b), args...);
}
}  // namespace Modulo
namespace Miracle {
const int N = 1e6 + 5;
struct po {
  long double x, y;
  po() {}
  po(long double xx, long double yy) {
    x = xx;
    y = yy;
  }
  po friend operator-(const po &a, const po &b) {
    return po(a.x - b.x, a.y - b.y);
  }
} p[N];
int a[N];
long long s[N];
long double ans[N];
int n;
int sta[N], top;
long double cha(po A, po B) { return A.x * B.y - A.y * B.x; }
int main() {
  rd(n);
  for (int i = 1; i <= n; ++i) {
    rd(a[i]);
    s[i] = s[i - 1] + a[i];
    p[i].x = i, p[i].y = s[i];
  }
  p[0].x = 0;
  p[0].y = 0;
  sta[++top] = 0;
  for (int i = 1; i <= n; ++i) {
    while (top > 1 &&
           cha(p[i] - p[sta[top - 1]], p[sta[top]] - p[sta[top - 1]]) > 0)
      --top;
    sta[++top] = i;
  }
  for (int i = 1; i < top; ++i) {
    long double sum = s[sta[i + 1]] - s[sta[i]];
    long double now = sum / (sta[i + 1] - sta[i]);
    for (int j = sta[i] + 1; j <= sta[i + 1]; ++j) {
      ans[j] = now;
    }
  }
  for (int i = 1; i <= n; ++i) {
    printf("%.9Lf\n", ans[i]);
  }
  return 0;
}
}  // namespace Miracle
signed main() {
  Miracle::main();
  return 0;
}
