#include <cstdio>
#include <cstring>
#include <algorithm>
#define int long long
using namespace std;
int n, a[200050], f[5050][5050];
signed main()
{
//    freopen("freight.in", "r", stdin);
//    freopen("freight.out", "w", stdout);
    scanf("%lld", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%lld", a + i);
    for (int l = 0; l < n; ++l)
    {
        for (int r = n + 1; r > l + 1; --r)
        {
            f[l][r] = 1e18;
            if (l != 0)
                f[l][r] = min(f[l][r], a[l] * (l + n - r) + f[l - 1][r]);
            if (r != n + 1)
                f[l][r] = min(f[l][r], a[r] * (l + n - r) + f[l][r + 1]);
            if (l == 0 && r == n + 1)
                f[l][r] = 0;
        }
    }
    for (int i = 1; i <= n; ++i)
        printf("%lld ", a[i] * (n - 1) + f[i - 1][i + 1]);
    return 0;
}