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

long long total_cost = 0;
bool check(vector<int> &arr, long long x){
	int n = arr.size();
	int med = 0;
	if(n%2 == 0)
	 med = n/2-1;
	else
	 med = (n-1)/2;
	int sum = 0;
	for(int i = 0; i < n; i++)
	sum += arr[i];
	
	int cost_of_med = 0;
	for(int i = med; i < n; i++){
		if(arr[i] < x)
		cost_of_med += x-arr[i];
	}
	total_cost = n*x - sum;
	if(cost_of_med > total_cost)
	return false;

	return true;
}

int main() {
	int n; cin >> n;
	vector<int> arr(n);
	for(int i = 0; i < n; i++)
	cin >> arr[i];
	sort(arr.begin(), arr.end());
	
	int med = 0;
	if(n%2 == 0)
	 med = n/2-1;
	else
	 med = (n-1)/2;
	long long lo = arr[med];
	long long hi = 10e9;
	long long ans = 0;
	while(lo <= hi){
		long long mid = (lo+hi)/2;
		if(check(arr,mid) == false){
			lo = mid+1;
		}
		else{
			ans = total_cost;
			hi = mid-1;
		}
	}
	cout << ans;
	return 0;
}