#include <bits/stdc++.h>
#include <atcoder/all>
// https://qandori.github.io/cp-library/
using namespace std;
using namespace atcoder;
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
// g++ a.cpp -std=c++23 -I.
// g++ -std=c++23 -I. a.cpp -o main
// g++ -std=c++23 -I. anaive.cpp -o naive
// g++ -std=c++23 -I. agene.cpp -o gene

using mint = modint998244353;

vl ru(vl a){
    ll n=a.size();
    vl ans(n);
    ll now=0;
    rep(i,0,n){
        now=max(now,i+1);
        while(now<n){
            if(a[now-1]<a[now])now++;
        }
        ans[i]=now;
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll n;
    cin>>n;
    vl a(n);
    vl b(n);
    rep(i,0,n){
        cin>>a[i];
    }
    rep(i,0,n){
        cin>>b[i];
    }
    vl c(n);
    vl d(n);
    rep(i,0,n)c[i]=a[i]+b[i];
    rep(i,0,n)d[i]=a[i]-b[i];
    vl u=ru(c);
    vl r=ru(d);
    ll ans=0;
    rep(i,0,n){
        ans+=min(u[i],r[i])-i;
    }
    cout<<ans-n<<endl;
}