#include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;

int main(){
    int n;
    cin>>n;
    ll a[n];
    rep(i,n)cin>>a[i];
    ll sum[2][4];
    rep(i,2)rep(j,4)sum[i][j]=0;
    sort(a,a+n);
    rep(i,n){
        sum[i%2][0]+=a[i];
    }
    rep(i,n){
        sum[i%2][1]+=a[n-i-1];
    }
    rep(i,n){
        if(2*i<=n)sum[0][2]+=a[i];
        else sum[1][2]+=a[i];
    }
    rep(i,n){
        if(2*i<n)sum[1][3]+=a[i];
        else sum[0][3]+=a[i];
    }
    ll ret[4];
    rep(i,4)ret[i]=abs(sum[0][i])-abs(sum[1][i]);
    cout<<max(min(ret[0],ret[2]),min(ret[1],ret[3]));

    return 0;
}