#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N;cin>>N;
    vl X,Y;
    for(int i=0;i<N;i++){
        ll x;cin>>x;
        if(x>0) X.pb(x);
        else Y.pb(x);
    }
    sort(all(X));
    sort(all(Y));
    reverse(all(Y));
    
    if(si(X)==0){
        ll ans=0;
        for(ll a:Y) ans+=(-a)*2;
        ans-=abs(Y.back());
        ans-=abs(Y[si(Y)-2]);
        cout<<ans<<"\n";
    }else if(si(X)==1){
        ll ans=0;
        for(ll a:X) ans+=(a)*2;
        for(ll a:Y) ans+=(-a)*2;
        vl S={X.back(),-Y.back()};
        if(si(Y)>=2) S.pb(-Y[si(Y)-2]);
        sort(all(S));
        ans-=S.back();
        ans-=S[si(S)-2];
        cout<<ans<<"\n";
    }else{
        ll ans=X.back()-X[0];
        ans+=X.back();
        ans+=X[0];
        for(ll a:Y) ans+=(-a)*2;
        vl S={X.back(),X[0]};
        if(si(Y)) S.pb(-Y.back());
        if(si(Y)>=2) S.pb(-Y[si(Y)-2]);
        sort(all(S));
        //cout<<ans<<endl;
        ans-=S.back();
        ans-=S[si(S)-2];
        cout<<ans<<"\n";
    }
    
}