#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    ll n; cin >> n;
    ll a[n] = {};
    rep(i,n) cin >> a[i];
    sort(a,a+n);
    ll ans = -1001001001001001001;
    ll x = 0, y = 0;
    rep(i,n){
        if(i % 2 == 0) x += a[i];
        else y += a[i];
    }
    ll ans1 = abs(x) - abs(y);
    x = 0, y = 0;
    rep(i,n){
        if(i < (n+1)/2) x += a[i];
        else y += a[i];
    }
    ll ans2 = abs(x) - abs(y);
    ans = min(ans1, ans2);

    
    sort(a,a+n,greater<ll>());
    x = 0, y = 0;
    rep(i,n){
        if(i % 2 == 0) x += a[i];
        else y += a[i];
    }
    ans1 = abs(x) - abs(y);
    x = 0, y = 0;
    rep(i,n){
        if(i < (n+1)/2) x += a[i];
        else y += a[i];
    }
    ans2 = abs(x) - abs(y);
    ans = max(ans,min(ans1, ans2));

    cout << ans << endl;
    return 0;
}