#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#ifdef LOCAL
#include <debug.hpp>
#include <misc.hpp>
#else
#define debug(...)
#endif

constexpr ll INF = 1LL << 60;

ll naive(int N, vector<ll> A) {
    auto f = [](int x, int y) -> ll { return (x < 0 && y < 0) ? -(x + y) : abs(x - y); };
    ranges::sort(A);
    ll ans = INF;
    do {
        ll val = 0;
        for (int i = 0; i + 1 < N; i++) val += f(A[i], A[i + 1]);
        ans = min(ans, val);
    } while (next_permutation(A.begin(), A.end()));
    return ans;
}

ll solve(int N, vector<ll> A) {
    auto f = [](int x, int y) -> ll { return (x < 0 && y < 0) ? -(x + y) : abs(x - y); };
    ll ans = INF;
    ranges::sort(A);
    {
        ll val = 0;
        for (int i = 0; i + 1 < N; i++) val += f(A[i], A[i + 1]);
        ans = min(ans, val);
    }
    ranges::rotate(A, A.begin() + 1);
    {
        ll val = 0;
        for (int i = 0; i + 1 < N; i++) val += f(A[i], A[i + 1]);
        ans = min(ans, val);
    }
    return ans;
}

// void test() {
//     int t;
//     cin >> t;
//     while (t--) {
//         int N = rng(3, 8);
//         vector<ll> A(N);
//         for (int i = 0; i < N; i++) A[i] = rng(-1e9, 1e9);
//         ll ans1 = naive(N, A);
//         ll ans2 = solve(N, A);
//         if (ans1 != ans2) {
//             debug(N, A, ans1, ans2);
//             assert(false);
//         }
//     }
// }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int N;
    cin >> N;
    vector<ll> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];
    cout << solve(N, A) << "\n";
}