#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;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpsb25nIGxvbmcgdG90YWxfY29zdCA9IDA7CmJvb2wgY2hlY2sodmVjdG9yPGludD4gJmFyciwgbG9uZyBsb25nIHgpewoJaW50IG4gPSBhcnIuc2l6ZSgpOwoJaW50IG1lZCA9IDA7CglpZihuJTIgPT0gMCkKCSBtZWQgPSBuLzItMTsKCWVsc2UKCSBtZWQgPSAobi0xKS8yOwoJaW50IHN1bSA9IDA7Cglmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQoJc3VtICs9IGFycltpXTsKCQoJaW50IGNvc3Rfb2ZfbWVkID0gMDsKCWZvcihpbnQgaSA9IG1lZDsgaSA8IG47IGkrKyl7CgkJaWYoYXJyW2ldIDwgeCkKCQljb3N0X29mX21lZCArPSB4LWFycltpXTsKCX0KCXRvdGFsX2Nvc3QgPSBuKnggLSBzdW07CglpZihjb3N0X29mX21lZCA+IHRvdGFsX2Nvc3QpCglyZXR1cm4gZmFsc2U7CgoJcmV0dXJuIHRydWU7Cn0KCmludCBtYWluKCkgewoJaW50IG47IGNpbiA+PiBuOwoJdmVjdG9yPGludD4gYXJyKG4pOwoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKykKCWNpbiA+PiBhcnJbaV07Cglzb3J0KGFyci5iZWdpbigpLCBhcnIuZW5kKCkpOwoJCglpbnQgbWVkID0gMDsKCWlmKG4lMiA9PSAwKQoJIG1lZCA9IG4vMi0xOwoJZWxzZQoJIG1lZCA9IChuLTEpLzI7Cglsb25nIGxvbmcgbG8gPSBhcnJbbWVkXTsKCWxvbmcgbG9uZyBoaSA9IDEwZTk7Cglsb25nIGxvbmcgYW5zID0gMDsKCXdoaWxlKGxvIDw9IGhpKXsKCQlsb25nIGxvbmcgbWlkID0gKGxvK2hpKS8yOwoJCWlmKGNoZWNrKGFycixtaWQpID09IGZhbHNlKXsKCQkJbG8gPSBtaWQrMTsKCQl9CgkJZWxzZXsKCQkJYW5zID0gdG90YWxfY29zdDsKCQkJaGkgPSBtaWQtMTsKCQl9Cgl9Cgljb3V0IDw8IGFuczsKCXJldHVybiAwOwp9