#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000003

int op(int a,int b){
	return max(a,b);
}

int e(){
	return -Inf;
}
int main() {
	
	int n;
	cin>>n;
	
	vector<int> a(n),b(n);
	rep(i,n)scanf("%d",&a[i]);
	rep(i,n)scanf("%d",&b[i]);
	vector<int> x(n),y(n);
	rep(i,n){
		x[i] = a[i]+b[i];
		y[i] = a[i]-b[i];
	}
	
	segtree<int,op,e> s0(x),s1(y);
	
	long long ans = 0LL;
	int l = 0;
	rep(i,n){
		while(true){
			bool f = true;
			if(s0.prod(l,i)>=x[i])f = false;
			if(s1.prod(l,i)>=y[i])f = false;
			if(f)break;
			l++;
		}
		//cout<<i<<','<<l<<endl;
		ans += i-l;
	}
	cout<<ans<<endl;
	
}