#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ldb;
typedef pair<int, int> pii;
const int MAXN = 1e5 + 5;

struct Vector {
    ll x, y;
    Vector(void) {}
    Vector(ll _x, ll _y): x(_x), y(_y) {}
};
Vector operator - (const Vector &p, const Vector &q) {
    return Vector(p.x - q.x, p.y - q.y);
}
ll cross(const Vector &p, const Vector &q) {
    return p.x * q.y - p.y * q.x;
}

int a[MAXN];

int main(void) {
    int n;
    scanf("%d", &n);

    for (int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);

    static Vector h[MAXN];
    int tp = 0;
    h[++tp] = Vector(0, 0);

    for (int i = 1; i <= n + 1; ++i) {
        Vector cur(i, a[i]);

        while (tp >= 2 && cross(cur - h[tp], cur - h[tp - 1]) <= 0)
            --tp;

        h[++tp] = cur;
    }

    const ll B = 1e5;

    static ll ans[MAXN];

    for (int i = 1; i < tp; ++i) {
        ll dx = h[i + 1].x - h[i].x;
        ll dy = h[i + 1].y - h[i].y;

        for (int j = h[i].x; j < h[i + 1].x; ++j)
            ans[j] = h[i].y * B
                     + (__int128)dy * (j - h[i].x) * B / dx;
    }

    for (int i = 1; i <= n; ++i)
        printf("%lld\n", ans[i]);

    return 0;
}