#include <bits/stdc++.h>
using namespace std;

#define REP(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define REPS(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define RREP(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define RREPS(i, n) for (int i = ((int)(n)); i > 0; i--)
#define IREP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define IREPS(i, m, n) for (int i = (int)(m); i <= (int)(n); ++i)
#define FOR(e, c) for (auto &e : c)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RVISORT(v) sort(v.begin(), v.end(), greater<int>());
#define ALL(v) v.begin(), v.end()

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using ll = long long;

typedef long long ll;

template<class T, class C> void chmax(T& a, C b){ a>b?:a=b; }
template<class T, class C> void chmin(T& a, C b){ a<b?:a=b; }

const ll mod=1e9+7;
int main()
{
    cin.tie( 0 );
    ios::sync_with_stdio( false );
	
	int n;cin>>n;
	VI v(n);
	REP(i,n){
		cin >> v[i];
	}

	ll ans=-1;
	REP(i,n-1){
		IREP(j,1,n){
			if(v[i]==v[j])continue;
			ll tmp=0;
			REP(k,n){
				if(k==i||k==j)continue;
				tmp+=min(abs(v[i]-v[k]),abs(v[j]-v[k]));
			}
			if(ans>tmp|ans==-1)ans=tmp;
		}
	}
	if(ans==-1) ans=1;
	cout << ans << endl;

    return 0;
}