#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll N_MAX = 2e5;

int main(){
    ll n;
    cin >> n;

    vector<ll> a(n), b(n);
    rep(i, n) cin >> a[i];
    rep(i, n) cin >> b[i];

    ll ans = 0;
    multiset<ll> p, m;
    for(ll l=0, r=0; l<n-1; l++){
        if(l == r){
            p.insert(a[l]+b[l]);
            m.insert(a[l]-b[l]);
            r++;
        }

        if(r < n){
            while(p.lower_bound(a[r]+b[r])==p.end() && m.lower_bound(a[r]-b[r])==m.end()){
                p.insert(a[r]+b[r]);
                m.insert(a[r]-b[r]);
                r++;
                if(r == n) break;
            }
        }
        
        ans += (r-l-1);
        p.erase(p.lower_bound(a[l]+b[l]));
        m.erase(m.lower_bound(a[l]-b[l]));
    }

    cout << ans << endl;
}