#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 1e4 + 10, INF = 0x3f3f3f3f, mod = 998244353;

inline int read() {
    int f = 1, k = 0;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        k = k * 10 + c - '0';
        c = getchar();
    }
    return f * k;
}

int n;
int a[N], f[N], dp[N];

int main() {
    // ios::sync_with_stdio(0); cin.tie(0);
    n = read();
    for (int i = 1; i <= n; ++i) a[i] = read();
    vector<int> ans;
    for (int k = 1; k <= n; ++k) {
        // int g = -INF, h = -INF;
        // for (int i = 1; i <= k; ++i) {
        //     g = max(g, dp[i - 1] - a[i]);
        //     h = max(h, dp[i - 1] + a[i]);
        // }
        int g = dp[k - 1] - a[k];
        int h = dp[k - 1] + a[k];
        for (int i = 1; i <= k; ++i) f[i] = 0;
        for (int i = k + 1; i <= n; ++i) {
            f[i] = max(g + a[i], h - a[i]);
            g = max(g, dp[i - 1] - a[i]);
            h = max(h, dp[i - 1] + a[i]);
            // cout << f[i] << " \n"[i == n];
        }
        ans.emplace_back(f[n]);
        printf("%d\n", f[n]);
        swap(f, dp);
    }
    // for (int i: ans) printf("%d\n", i);
}