bool M1;
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db double
#define pb push_back
#define pii pair<int,int>
#define mkp make_pair
#define fr first
#define sc second
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n'
template<typename T> void ckmin(T &x,T y){x=min(x,y);}
template<typename T> void ckmax(T &x,T y){x=max(x,y);}
mt19937 rnd(time(0));
const int N=10005;
const int inf=1e9;
const int mod=1000000007;
int n;
int a[N];
int f[N][2][2];//<k,min,max>
bool M2;
signed main(){
	look_memory;
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=0;i<=n;i++) f[i][0][0]=f[i][0][1]=f[i][1][0]=f[i][1][1]=-inf;
	f[0][0][0]=0;
	for(int i=1;i<=n;i++){
		for(int j=i;j>=0;j--){
			if(j) f[j][0][0]=f[j-1][1][1];
			ckmax(f[j][0][1],f[j][0][0]+a[i]);
			ckmax(f[j][1][0],f[j][0][0]-a[i]);
			ckmax(f[j][1][1],max(f[j][0][1]-a[i],f[j][1][0]+a[i]));
		}
	}
	for(int i=0;i<n;i++) cout<<f[i][1][1]<<"\n";
	return 0;
}