#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);
	int n; cin >> n;
    vector<pair<int, int>>a(n);
    vector<pair<int, int>>l(n), r(n);
    set<int>p;
    for(auto &i : a) cin >> i.first;
    for(int i = 0; i < n; i++)
    {
        cin >> a[i].second;
        a[i].first -= a[i].second;
        a[i].second = a[i].first + 2 * a[i].second;
        l[i] = {a[i].first, i};
        r[i] = {a[i].second, i};
        p.insert(a[i].first);
        p.insert(a[i].second);
    }
    sort(l.begin(), l.end());
    sort(r.begin(), r.end());
    int ans = 0;
    int prev = l[0].first;
    set<pair<int, int>>s;
    int cnt1 = 0, cnt2 = 0;
    for(int u : p)
    {
        if(!s.empty()) ans += (u - prev) * (*s.rbegin()).first;
        while(cnt2 < n && r[cnt2].first == u)
        {
            int i = r[cnt2].second;
            s.erase({a[i].second - a[i].first, i});
            cnt2++;
        }
        while(cnt1 < n && l[cnt1].first == u)
        {
            int i = l[cnt1].second;
            s.insert({a[i].second - a[i].first, i});
            cnt1++;
        }
        prev = u;
    }
    cout << ans;
}