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

int main() {
	int n;
    cin >> n;
    vector<pair<pair<unsigned long long,unsigned long long>,unsigned long long>> v(n), sor;
    vector<unsigned long long> pos(n), size(n);
    for(int i = 0; i < n; i++) cin >> pos[i];
    for(int i = 0; i < n; i++) cin >> size[i];
    for(int i = 0; i < n; i++) v[i] = make_pair(make_pair(pos[i]-size[i], pos[i]+size[i]), size[i]*2);
    sort(v.begin(), v.end());

    //for(auto i : v) cout << i.first.first << ' ' << i.first.second << ' ' << i.second << '\n';
    sor.push_back(v[0]);
    for(int i = 1; i < n; i++) {
        if(v[i].first.second > sor[sor.size()-1].first.second) {
            if(v[i].first.first == sor[sor.size()-1].first.first && v[i].second > sor[sor.size()-1].second) {
                sor[sor.size()-1] = v[i];
            } else if(v[i].first.first >= sor[sor.size()-1].first.second) {
                sor.push_back(v[i]);
            } else if(v[i].second >= sor[sor.size()-1].second) {
                sor[sor.size()-1].first.second = v[i].first.first;
                sor.push_back(v[i]);
            } else if(v[i].second < sor[sor.size()-1].second) {
                sor.push_back(v[i]);
                sor[sor.size()-1].first.first = sor[sor.size()-2].first.second;
            }
        }
    }

    unsigned long long s = 0;
    for(auto i : sor) s += (i.first.second-i.first.first)*i.second;
    //cout << i.first.first << ' ' << i.first.second << ' ' << i.second << '\n';
    
    cout << s;

    return 0;
}