#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 5005
#define ll long long
#define ul unsigned long long
#define int long long
#define db double 
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
int n,m,p[N<<1][N],a[N<<1],ans;const int inf=1e18;
int abs(int x,int y){return x>y?x-y:y-x;}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("Mountains.in","r",stdin);freopen("Mountains.out","w",stdout);
	n=read();
	a[0]=inf;fo(i,1,n)a[++m]=read(),a[++m]=inf;
	fo(i,1,m)
		for(int j=0;1<=i-j&&i-j<=m;j++)
			p[i][j+1]=p[i][j]+abs(a[i-j],a[i+j]);
	fo(i,1,n)
	{
		ans=inf;
		for(int j=i;j<=m-i+1;j+=2)
		{
			ans=min(ans,p[j][i]);
		}
		printf("%lld ",ans);
	}
	return 0;
}