#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N=5005;
int f[N][N],ans[N],n,h[N];
int ABS(int x){
	return x<0?-x:x;
}
int main(){
	freopen("Mountains.in","r",stdin);
	freopen("Mountains.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",h+i);
	}
	memset(ans,0x3f,sizeof(ans));
	ans[1]=0;
	for(int l=2;l<=n;l++){
		for(int i=1;i+l-1<=n;i++){
			int j=i+l-1;
			f[i][j]=f[i+1][j-1]+ABS(h[i]-h[j]);
			ans[l]=min(ans[l],f[i][j]);
		}
	}
	for(int i=1;i<=n;i++){
		printf("%d ",ans[i]);
	}
	return 0;
}