#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define endl "\n"

const long long INF = (long long)1e18;
const long long MOD = (long long)1e9 + 7; 

string yn(bool f){return f?"Yes":"No";}
string YN(bool f){return f?"YES":"NO";}

#define MAX 110000

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	int N;
	static int Y[MAX];
	int ans = INF;
	int sum1 = 0, sum2 = 0;
	bool flag = false;
	
	cin>>N;
	
	
	for(int i = 0; i < N; i++){
		scanf("%d", &Y[i]);
		if(Y[i] != Y[0]) flag = true;
	}
	
	if(!flag){
		cout<<1<<endl;
		return 0;
	}
	
	sort(Y, Y+N);
	
	for(int i = 1; i < N; i++)sum2 += abs(Y[i]-Y[(N-1+1)/2]);
	
	for(int i = 1; i < N; i++){
		ans = min(ans, sum1+sum2);
		sum1 += (Y[(0+i)/2] - Y[(0+i-1)/2])*(0+i)/2 - (Y[(0+i)/2] - Y[(0+i-1)/2])*(i - (0+i)/2) + Y[i] - Y[(0+i)/2];
		sum2 += (Y[(N-1+i+1)/2] - Y[(N-1+i)/2])*((N-1+i-1)/2 - i) - (Y[(N-1+i+1)/2] - Y[(N-1+i)/2])*(N - (N-1+i)/2-1) - (Y[(N-1+i)/2] - Y[i]);
	}
	
	cout<<ans<<endl;
	
	
	return 0;
}