#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

long long f(long long x, long long y) {
    return x < 0 and y < 0 ? -x-y : abs(x-y);
}

int main() {
    int n; cin >> n;
    vector<long long> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a.begin(), a.end());
    vector<long long> b{a.front()};
    for (int i = 2; i < n; i++) b.emplace_back(a[i]);
    b.emplace_back(a[1]);
    if (a.back() < 0){
        long long ans = 0;
        for (int i = 0; i < n-1; i++) ans += f(b[i], b[i+1]);
        cout << ans << "\n";
        return 0;
    }
    long long ans = 0;
    for (int i = 0; i < n-1; i++) ans += f(a[i], a[i+1]);
    if (a[1] < 0){
        long long ans2 = 0;
        for (int i = 0; i < n-1; i++) ans2 += f(b[i], b[i+1]);
        ans = min(ans, ans2);
    }
    cout << ans << "\n";
}