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

template<class T> istream& operator >> (istream& is, vector<T>& vec) {
    for(T& x : vec) is >> x;
    return is;
}

template<class T> ostream& operator << (ostream& os, const vector<T>& vec) {
    if(vec.empty()) return os;
    os << vec[0];
    for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it;
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n);
    cin >> a;
    sort(a.begin(), a.end());
    ll ans = 0;
    auto f = [&](int v1, int v2){
        if(v1 < 0 && v2 < 0) return -v1 - v2;
        return abs(v1 - v2);
    };
    if(n == 2){
        cout << f(a[0], a[1]) << '\n';
        return 0;
    }
    ll mn = 0, sv = 0;
    for(int i = 0; i + 1 < n; i++){
        mn += f(a[i], a[i + 1]);
    }
    rotate(a.begin() + 1, a.begin() + 2, a.end());
    for(int i = 0; i + 1 < n; i++){
        sv += f(a[i], a[i + 1]);
    }
    mn = min(mn, sv);
    sv = 0;
    swap(a[0], a.back());
    for(int i = 0; i + 1 < n; i++){
        sv += f(a[i], a[i + 1]);
    }
    mn = min(mn, sv);
    sort(a.rbegin(), a.rend());
    sv = 0;
    for(int i = 0; i + 1 < n; i++){
        sv += f(a[i], a[i + 1]);
    }
    mn = min(mn, sv);
    rotate(a.begin() + 1, a.begin() + 2, a.end());
    sv = 0;
    for(int i = 0; i + 1 < n; i++){
        sv += f(a[i], a[i + 1]);
    }
    mn = min(mn, sv);
    sv = 0;
    swap(a[0], a.back());
    for(int i = 0; i + 1 < n; i++){
        sv += f(a[i], a[i + 1]);
    }
    mn = min(mn, sv);
    cout << mn << '\n';
}