#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    int n; cin>>n;
    ll c[100010];
    for(int i=0; i<n; i++) cin>>c[i];
    sort(c, c+n);
    ll s1=0, s2=0, s3=0, s4=0;
    for(int i=0; i<n; i+=2){
        s1+=c[n-1-i];
        if(n-1-i-1>=0) s2+=c[n-1-i-1];
    }
    for(int i=0; i<=n-1-i; i++){
        s3+=c[n-1-i];
        if(i<n-1-i) s4+=c[i];
    }
    ll ans1=min(abs(s1)-abs(s2), abs(s3)-abs(s4));
    reverse(c, c+n);
    s1=0, s2=0, s3=0, s4=0;
    for(int i=0; i<n; i+=2){
        s1+=c[n-1-i];
        if(n-1-i-1>=0) s2+=c[n-1-i-1];
    }
    for(int i=0; i<=n-1-i; i++){
        s3+=c[n-1-i];
        if(i<n-1-i) s4+=c[i];
    }
    ll ans2=min(abs(s1)-abs(s2), abs(s3)-abs(s4));
    cout<<max(ans1, ans2)<<endl;
    return 0;
}