#include <bits/stdc++.h>   using namespace std;   const int maxm = 1e6 + 5;   double q[maxm];   int buf[maxm], len[maxm];   void run_case() {     int n;     cin >> n;     int top = 0;     for (int i = 1; i <= n; ++i) cin >> buf[i];     q[++top] = buf[1], len[1] = 1;     for (int i = 2; i <= n; ++i) {       double now = buf[i];       int nowlen = 1;       while (q[top] > now) {         now = (now * nowlen + q[top] * len[top]) / (nowlen + len[top]);         nowlen += len[top--];       }       q[++top] = now, len[top] = nowlen;     }     for (int i = 1; i <= top; ++i)       for (int j = 0; j < len[i]; ++j) cout << q[i] <<   n ;   }   int main() {     ios::sync_with_stdio(false), cin.tie(0);     cout.setf(ios_base::showpoint);     cout.precision(10);     run_case();     cout.flush();     return 0;   }   