#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define ll long long

using namespace std;

map <ll,int> q;

int main() {
    ios_base::sync_with_stdio( 0 );
    cin.tie( 0 );
    cout.tie( 0 );
#ifdef LOCAL
    freopen( "input.txt", "r", stdin );
    freopen( "output.txt", "w", stdout );
#endif //LOCAL
    int n;
    cin>>n;
    vector <ll> a(2*n);
    for ( int i = 0; i < 2*n; i++ ) {
        cin>>a[i];
        q[a[i]]++;
    }
    sort( a.begin(), a.end() );
    ll ans = 0;
    ll mx = 0;
    vector <ll> v;
    n -= 1;
    for ( int i = 0; i < a.size(); i++ ) {
        while ( q[a[i]] > 1 && n > 0  ) {
            q[a[i]] -= 2;
            n--;
        }
        while ( q[a[i]] ) {
            v.pb(a[i]);
            q[a[i]]--;
        }
    }
    sort( v.begin(), v.end() );
    for ( int i = 0; i < v.size() - 1; i+=2 ) {
        ans += abs( v[i] - v[i+1] );
        mx = max( mx, abs( v[i] - v[i+1] ) );
    }
    cout<<ans - mx;
    return 0;
}