#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto&& e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S>
bool chmin(T& a, const S& b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
bool chmax(T& a, const S& b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main(){
  int N;
  cin>>N;
  vi Neg,Pos;
  rep(i,N){
    int A;
    cin>>A;
    if(A<0)Neg.eb(A);
    else Pos.eb(A);
  }
  ll ans=0;
  sort(all(Neg));
  if(Pos.empty()){
    rep(i,min(2,sz(Neg))){
      ans-=Neg[i];
    }
    rep(i,2,sz(Neg)){
      ans-=Neg[i]*2;
    }
  }else if(Neg.empty()){
    ans=(*max_element(all(Pos)))-(*min_element(all(Pos)));
  }else{
    ll ansA=0,ansB=0;
    rep(i,min(1,sz(Neg)))ansA-=Neg[i];
    rep(i,1,sz(Neg))ansA-=Neg[i]*2;
    ansA+=*max_element(all(Pos));
    rep(i,min(2,sz(Neg)))ansB-=Neg[i];
    rep(i,2,sz(Neg))ansB-=Neg[i]*2;
    ansB+=*max_element(all(Pos))*2;
    ans=min(ansA,ansB);
  }
  cout<<ans<<'\n';
}