#include<iostream>
#include<algorithm>
#include<vector>

int N;
std::vector<int> v(1e5);

long long solve(long long mid){
    long long cnt = 0;
    for(int i = 0; i < N; i++){
        cnt += std::abs(v[i] - mid);
    }
    return cnt;
}

long long solve2(int low, int high){
    long long min = 1e18;
    for(int i = low; i <= high; i++){
        long long ans = 0;
        for(int j = 0; j < N; j++){
            ans += std::abs(v[j] - i);
        }
        min = std::min(min, ans);
    }
    return min;
}

int main(){
    std::cin >> N;
    for(int i = 0; i < N; i++){
        std::cin >> v[i];
    }

    long long high = 1e9;
    long long low = -1e9;
    for(int i = 0; i < 100; i++){
        long long midu = (2 * high + low) / 3;
		long long midl = (high + 2 * low) / 3;

		if(solve(midl) < solve(midu))high = midu;
		else low = midl;
    }

    std::cout << solve2(low, high) << std::endl;
}