#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<ll> A(N);
	rep(i,N) cin>>A[i];
	So(A);
	vector<ll> p(4),q(4);
	rep(i,N){
		if(i%2) q[0]+=A[i];
		else p[0]+=A[i];
	}
	rep(i,N){
		if(i%2) q[1]+=A[N-1-i/2];
		else p[1]+=A[i/2];
	}
	rep(i,N){
		if(i%2) q[2]+=A[i/2];
		else p[2]+=A[N-1-i/2];
	}
	rep(i,N){
		if(i%2) q[3]+=A[i];
		else p[3]+=A[N-1-i];
	}
	vector<ll> r(4);
	rep(i,4) r[i]=abs(p[i])-abs(q[i]);/*
	vec_out(p);
	vec_out(q);*/
	cout<<max(min(r[0],r[1]),min(r[2],r[3]))<<"\n";
}