#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<ll,ll> P;
vector<ll> a;

ll solve(ll m) {
  vector<ll> v[2];
  rep(i,a.size()) {
    if(i<=m) v[0].pb(a[i]);
    else v[1].pb(a[i]);
  }
  ll ans=0;
  rep(k,2) {
    ll x=v[k][v[k].size()/2],s1=0;
    rep(i,v[k].size()) s1+=abs(x-v[k][i]);
    if(v[k].size()%2==0) {
      ll y=v[k][v[k].size()/2-1],s2=0;
      rep(i,v[k].size()) s2+=abs(y-v[k][i]);
      s1=min(s1,s2);
    }
    ans+=s1;
  }
  return ans;
}

void Main() {
  ll n;
  cin >> n;
  set<ll> s;
  rep(i,n) {
    ll x;
    cin >> x;
    a.pb(x);
    s.in(x);
  }
  if(s.size()==1) {
    pr(1);
    return;
  }
  sort(all(a));
  ll l=0,r=n-1;
  rep(tt,100) {
    ll m1=(l*2+r)/3,m2=(l+r*2)/3;
    ll d1=solve(m1),d2=solve(m2);
    if(d1>d2) l=m1;
    else r=m2;
  }
  ll ans=MAXL;
  REP(i,-500,500) {
    ll x=max(0LL,min(i+l,n-2));
    ans=min(ans,solve(x));
  }
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}