#include <bits/stdc++.h>
using namespace std;
const long long int INF = 9223372036854775807;
const long long int mod = 998244353;
long long int max3(long long int a, long long int b, long long int c) {
  return max(c, max(a, b));
}
long long int min3(long long int a, long long int b, long long int c) {
  return min(a, min(b, c));
}
long long int power(long long int x, long long int y, long long int mod1) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % mod1;
    y = y >> 1;
    x = (x * x) % mod1;
  }
  return res;
}
long long int logg(long long int a) {
  long long int x = 0;
  while (a > 1) {
    x++;
    a /= 2;
  }
  return x;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int abso(long long int x) {
  if (x < 0) {
    return -x;
  }
  return x;
}
long long int ceiling(long long int a, long long int b) {
  if (a % b == 0) {
    return a / b;
  } else {
    return a / b + 1;
  }
}
long long int modinv(long long int x, long long int p) {
  return power(x, p - 2, p);
}
struct point {
  long long int x;
  long long int y;
};
long long int cross(point a, point b) { return a.x * b.y - b.x * a.y; }
bool ccw1(point p1, point p2) {
  if (cross(p1, p2) > 0) {
    return true;
  } else {
    return false;
  }
}
bool comp(point p1, point p2) {
  if (p1.x < p2.x) {
    return true;
  } else {
    if (p1.x > p2.x) {
      return false;
    } else {
      if (p1.y <= p2.y) {
        return true;
      }
      return false;
    }
  }
}
long long ccw(point p1, point p2, point p3) {
  long long int val =
      (p2.y - p1.y) * (p3.x - p2.x) - (p2.x - p1.x) * (p3.y - p2.y);
  return val;
}
void ccw_sort(vector<point> &v) {
  vector<point> v1, v2;
  for (int i = 0; i < v.size(); i++) {
    if (v[i].y > 0) {
      v1.push_back(v[i]);
    } else {
      v2.push_back(v[i]);
    }
  }
  sort(v1.begin(), v1.end(), ccw1);
  sort(v2.begin(), v2.end(), ccw1);
  for (int i = 0; i < v2.size(); i++) {
    v1.push_back(v2[i]);
  }
  v = v1;
}
vector<point> lower_convex_hull(vector<point> pts) {
  sort(pts.begin(), pts.end(), comp);
  vector<point> H;
  for (int step = 0; step < 1; step++) {
    auto start = H.size();
    for (point P : pts) {
      while (H.size() >= start + 2 &&
             ccw(H[H.size() - 2], H[H.size() - 1], P) <= 0)
        H.pop_back();
      H.push_back(P);
    }
  }
  return H;
}
int main() {
  int n;
  scanf("%d", &n);
  vector<long long int> a(n);
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
  }
  vector<point> g;
  long long int sum = 0;
  point cur;
  cur.x = cur.y = 0;
  g.push_back(cur);
  for (int i = 0; i < n; i++) {
    sum += a[i];
    point pt;
    pt.x = sum;
    pt.y = i + 1;
    g.push_back(pt);
  }
  auto ans = lower_convex_hull(g);
  vector<double> v;
  for (int j = 1; j < ans.size(); j++) {
    for (long long int yy = ans[j - 1].y + 1; yy <= ans[j].y; yy++) {
      v.push_back((double)(ans[j].x - ans[j - 1].x) /
                  (double)(ans[j].y - ans[j - 1].y));
    }
  }
  for (int i = 0; i < v.size(); i++) {
    printf("%.12f\n", v[i]);
  }
}
