#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(ll i=0;i<n;i++) #define repl(i,l,r) for(ll i=(l);i<(r);i++) #define per(i,n) for(ll i=(n)-1;i>=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue<x,vector<x>,greater<x>> #define all(x) (x).begin(),(x).end() #define CST(x) cout<<fixed<<setprecision(x) #define rev(x) reverse(x); using ll=long long; using vl=vector<ll>; using vvl=vector<vector<ll>>; using pl=pair<ll,ll>; using vpl=vector<pl>; using vvpl=vector<vpl>; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={-1,0,1,0,1,1,-1,-1}; const ll dx[8]={0,-1,0,1,1,-1,1,-1}; template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } int main(){ ll n;cin >> n; vl v(n);rep(i,n)cin >> v[i]; sort(all(v)); //rep(i,n)cout << v[i] <<" ";cout << endl; ll ans=-INF; ll a=0,b=0; rep(i,n/2){ a+=v[i]; } rep(i,n/2){ b+=v[n-i-1]; } ll mid=(n%2? v[n/2]:0LL); ll ret1=abs(a+mid)-abs(b); ll c=0,d=0; rep(i,n){ if(i%2)d+=v[i]; else c+=v[i]; } ll ret2=abs(c)-abs(d); //cout << ret1 <<" " <<ret2 <<endl; chmax(ans,min(ret1,ret2)); ll ret3=0;c=0,d=0; rep(i,n){ if(i%2)d+=v[n-i-1]; else c+=v[n-i-1]; } ret3=abs(c)-abs(d); chmax(ans,min(ret3,abs(b+mid)-abs(a))); cout << ans <<endl; }