#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

const ll INF=1e18;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin>>N;
  vector<ll> A(N);
  rep(i,N) cin>>A[i];
  
  sort(all(A));

  ll ans=-INF;
  rep(s,2){
    ll res=INF;
    rep(t,2){
      multiset<ll> se;
      rep(i,N) se.insert(A[i]);
      ll sumA=0,sumB=0;
      for(int k=0;k<N;k++){
        if(k%2==0){
          auto itr=se.begin();
          if(s==1){
            itr=se.end();
            itr--;
          }
          sumA+=*(itr);
          se.erase(itr);
        }else{
          auto itr=se.begin();
          if(t==1){
            itr=se.end();
            itr--;
          }
          sumB+=*(itr);
          se.erase(itr);
        }
      }

      chmin(res,abs(sumA)-abs(sumB));
    }
    chmax(ans,res);
  }
  cout<<ans<<endl;

  return 0;
}