#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000005
#define Inf64 1000000000000000001LL
long long get(vector<long long> a){
	long long res = 0;
	rep(i,a.size()-1){
		if(a[i]<0 && a[i+1]<0)res += -a[i] - a[i+1];
		else res += abs(a[i]-a[i+1]);
	}

	return res;
}
int main(){
	
	int n;
	cin>>n;
	
	vector<vector<long long>> a(2);
	rep(i,n){
		long long t;
		cin>>t;
		if(t<0)a[0].push_back(t);
		else a[1].push_back(t);
	}
	sort(a[0].rbegin(),a[0].rend());
	sort(a[1].begin(),a[1].end());
	long long ans = Inf64;
	rep(i,2){
		rep(j,2){
			rep(k,2){
				vector<vector<long long>> c = a;
				vector<long long> b;
				if(c[i].size()==0)continue;
				b.push_back(c[i].back());
				c[i].pop_back();
				if(c[j].size()==0)continue;
				long long v = c[j].back();
				c[j].pop_back();
				rep(l,2){
					while(c[l^k].size()>0){
						b.push_back(c[l^k].back());
						c[l^k].pop_back();
					}
				}
				b.push_back(v);
				ans = min(ans,get(b));
			}
		}
	}
	cout<<ans<<endl;
}