#include<bits/stdc++.h>
//#pragma GCC optimize(3,"Ofast","inline")
//#define int long long
#define i128 __int128
#define ll long long
#define ull unsigned long long
#define ld double
#define PII pair<int,int>
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define rep(k,l,r) for(int k=l;k<=r;++k)
#define per(k,r,l) for(int k=r;k>=l;--k)
#define cl(f,x) memset(f,x,sizeof(f))
#define pcnt(x) __builtin_popcount(x)
using namespace std;
void file_IO() {
//	system("fc .out .ans");
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
}
bool M1;
const int N=1e4+5;
int a[N],f[2][N],n;
void solve() {
	scanf("%d",&n);
	rep(i,1,n)
		scanf("%d",&a[i]);
	cl(f[0],-0x3f);
	f[0][0]=0;
	rep(k,1,n) {
		f[k&1][0]=-INF;
		int res1=-INF,res2=-INF;
		rep(i,1,n) {
			chkmax(res1,f[(k&1)^1][i-1]-a[i]);
			chkmax(res2,f[(k&1)^1][i-1]+a[i]);
			f[k&1][i]=max(res1+a[i],res2-a[i]);
		}
		rep(i,1,n)
			chkmax(f[k&1][i],f[k&1][i-1]);
		printf("%d\n",f[k&1][n]);
	}
}
bool M2;
signed main() {
	//file_IO();
	int testcase=1;
	//scanf("%d",&testcase);
	while(testcase--)
		solve();
	fprintf(stderr,"used time = %ldms\n",1000*clock()/CLOCKS_PER_SEC);
	fprintf(stderr,"used memory = %lldMB\n",(&M2-&M1)/1024/1024);
	return 0;
}