#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define PII pair<int, int>
const int N = 4e5 + 5;
const int mod = 1e9 + 7;
int n, top, b[N], c[N], a[N], dp[N];
vector<PII> tr;
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> b[i], a[++top] = b[i];
    for (int i = 1; i <= n; i++)
        cin >> c[i], c[i] = max(c[i], b[i]), a[++top] = c[i];
    sort(a + 1, a + 1 + top);
    top = unique(a + 1, a + 1 + top) - a - 1;
    for (int i = 1; i <= n; i++)
    {
        b[i] = lower_bound(a + 1, a + 1 + top, b[i]) - a;
        c[i] = lower_bound(a + 1, a + 1 + top, c[i]) - a;
    }
    tr.push_back({0, 0});
    for (int i = 1; i <= n; i++)
        tr.push_back({b[i], c[i]});
    fill(dp + 1, dp + 1 + n, 1e18);
    dp[0] = 0;
    priority_queue<PII, vector<PII>, greater<PII>> q;
    q.push({0, 0});
    sort(tr.begin(), tr.end());
    // for (int i = 1; i <= n; i++)
    // {
    //     auto [l, r] = tr[i]; // 从一个盒子转移过来//pre//dp[i]=min{dp[pre]+tr[i].r-tr[pre].l+tr[i].r-tr[pre].l}
    //     int pre = q.top().second;
    //     dp[i] = dp[pre] + 2 * a[tr[i].second] - 2 * a[tr[pre].first] + a[tr[i].first] - a[tr[pre].first] - a[tr[pre].second] + a[tr[pre].first];
    //     q.push({dp[i] - a[tr[i].second] - a[tr[i].first] - a[tr[i].first], i});
    // }
    for (int i = 1; i <= n; i++)
    {
        dp[i] = dp[i - 1] + a[tr[i].first] - a[tr[i - 1].first] + 2 * (a[tr[i].second] - a[tr[i].first]);
    }
    int ans = 1e18, mx = a[top];
    for (int i = 1; i <= n; i++)
    {
        ans = min(dp[i - 1] + 2 * mx - 2 * a[tr[i].first] + a[tr[i].first] - a[tr[i - 1].first], ans);
    }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}