#include "bits/stdc++.h"

using namespace std;

#define endl "\n"
#define debug(x)  cerr <<#x<<" "<<x<<endl;
using ll = long long;
#define int ll
struct node {
    int ma, mi, va;
};
const int inf = -1e18;

node merry(node &a, node &b) {
    int mins = min(a.mi, b.mi);
    int maxs = max(a.ma, b.ma);
    node c;
    c.ma = maxs;
    c.mi = mins;
    c.va = maxs - mins;
    return c;

};

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n;
    cin >> n;
    vector<node> v(n + 1);
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        v[i].mi = v[i].ma = x;
        v[i].va = 0;
    }
    stack<int> ans;
    ans.emplace(0);
    for (int i = 1; i < n; i++) {
        int len = 0;
        int maxs = -inf;
        for (int j = 1; j <= n - i; j++) {
            node c = merry(v[j], v[j + 1]);
            if (maxs > v[j].va + v[j + 1].va - c.va) {
                maxs = v[j].va + v[j + 1].va - c.va;
                len = j;
            }
        }

        vector<node> mir(n - i + 1);
        for (int j = 1; j < len; j++) {
            mir[j] = v[j];
        }
        mir[len] = merry(v[len], v[len + 1]);
        ans.emplace(ans.top() - v[len].va - v[len + 1].va + mir[len].va);
//        debug(ans.top());
        for (int j = len + 2; j <= n - i + 1; j++) {
            mir[j - 1] = v[j];
        }
        v = mir;
    }
    while (!ans.empty()) {
        cout << ans.top() << endl;
        ans.pop();
    }
}