#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
template<class T> void check_min(T &a, const T &b){ a = (a < b) ? a : b; }
template<class T> void check_max(T &a, const T &b){ a = (a > b) ? a : b; }
#define all(x) (x).begin(), (x).end()

const int N = 1e5 + 3;
const ll INF = 1e18;

ll n, b[N], c[N];
pair<ll, bool> events[2 * N];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >> events[i].first;
        events[i].second = 1;
    }
    for(int i = 0; i < n; ++i){
        cin >> events[i + n].first;
        events[i + n].second = 0;
    }

    sort(events, events + 2 * n);

    stack<ll> st;
    ll cnt = 0, ans = 0, min_ans = INF;
    for(ll i = 0; i < 2 * n; ++i){
        auto [x, type] = events[i];
        if(st.empty()) check_min(min_ans, events[2 * n - 1].first - x + ans);
        if(!type){
            ++cnt;
            if(cnt >= st.size() && !st.empty()){
                cnt -= st.size();
                ans += (x - st.top()) * 2;
                while(!st.empty())
                    st.pop();
            }
        }
        else{
            if(st.empty() && cnt){
                --cnt;
            }
            else st.push(x);
        }
    }
    check_min(ans, min_ans);
    ans += events[2 * n - 1].first;

    cout << ans << "\n";
}