#include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n); i<(N); i++)
#define RREP(i,n,N) for(int i=(N-1); i>=n; i--)
#define CK(n,a,b) (a)<=(n)&&(n)<(b)
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
typedef long long ll;
using namespace std;
const ll inf=1e18;

ll N;
int a[100010];
ll search(ll mid){
    ll ret=0;
    REP(i,0,N){
        ret += abs(a[i]-mid);
    }
    return ret;
}
int main(){

    while(cin>>N){

        REP(i,0,N) cin>>a[i];
        ll lb=-1e9-1, ub=1e9;
        while(ub -lb > 3){
            ll mid1=(lb * 2 + ub) / 3; 
            ll mid2=(lb + ub * 2) / 3; 
            if(search(mid1) > search(mid2)) lb=mid1; 
            else ub = mid2;
        }
        ll ans = inf;
        for(ll i=lb; i<ub; i++){
            ans=min(ans,search(i));
        }
        p(ans);
    }
    return 0;
}