#include<iostream>
#include<algorithm>
using namespace std;
int N;
long Y[1<<17],sum[1<<17];
long dp[1<<17];
main()
{
	cin>>N;
	for(int i=0;i<N;i++)cin>>Y[i];
	sort(Y,Y+N);
	for(int i=0;i<N;i++)
	{
		sum[i+1]=sum[i]+Y[i];
		dp[i+1]=9e18;
	}
	for(int i=0;i<N-1;i++)
	{
		if(dp[i]==9e18)continue;
		int id=i+2;
		while(id<N&&Y[id-1]==Y[id])id++;
		int a=(i+id)/2;
		dp[id]=min(dp[id],dp[i]+sum[id]-sum[a]-Y[a]*(id-a)+Y[a]*(a-i)-sum[a]+sum[i]);
		id++;
		if(id>N)continue;
		a=(i+id)/2;
		dp[id]=min(dp[id],dp[i]+sum[id]-sum[a]-Y[a]*(id-a)+Y[a]*(a-i)-sum[a]+sum[i]);
	}
	cout<<dp[N]<<endl;
}