#include<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

typedef long long int ll;
const int MAX_N = 100000;
int Y[MAX_N] ;
int N;

ll ans = 0;

ll distsum(int k){
	ll sum = 0;
	
	for(int i = 0; i < N; i++){
		sum += abs(Y[i]-k) ;
	}
	
	return sum;
}

	
int main(void){
	cin >> N;
	for(int k = 0; k < N; k++){
		cin >> Y[k] ;
	}
	
	ans = distsum(Y[0]) ;
	
	for(int i = 0; i < N; i++){
		ans = min(ans,distsum(Y[i]));
	}
	
	cout << ans << endl;
	
	
	
	
	return 0;
}