#include<stdio.h>

int n,a[1001][1001];

int Abs(int a)
{
	if(a<0)
	{
		return -a;
	}
	else
	{
		return a;
	}
}

int max(int a,int b)
{
	return a>b?a:b;
}

int main()
{
	freopen("remove.in","r",stdin);
	freopen("remove.out","w",stdout);
	int i,j,k,tmp;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&a[1][i]);
	}
	for(i=2;i<=n;i++)
	{
		for(j=1;j<=n-i+1;j++)
		{
			a[i][j]=Abs(a[1][j]-a[1][i+j-1])*i;
			for(k=1;k<i;k++)
			{
				tmp=a[k][j]+a[i-k][j+k];
				if(tmp>a[i][j])
					a[i][j]=tmp;
			}
		}
	}
	printf("%d\n",a[n][1]);
	return 0;
}