#include <iostream>
#include <vector>
#include <queue>
#include <cassert>

#define rep(i,n) for(int i = 0; i < (int)(n); i++)

using namespace std;
using LL = long long;
using P = pair<int, int>;

const int Max_N = (int)2e5;
const int Max_A = (int)1e9;

int main() {
	int N;
	cin >> N;
	vector<int> A(N), B(N);
	rep(i, N) cin >> A[i];
	rep(i, N) cin >> B[i];

	assert(2 <= N && N <= Max_N);
	rep(i, N - 1) assert(A[i] < A[i + 1]);
	rep(i, N) assert(1 <= A[i] && A[i] <= Max_A);
	rep(i, N) assert(1 <= B[i] && B[i] <= Max_A);

	LL ans = 0;
	int l = -1, r = 0;
	priority_queue<P> q_dif, q_sum;

	while (r < N) {
		int d = A[r] - B[r], s = A[r] + B[r];
		while (!q_dif.empty()) {
			P p = q_dif.top();
			if (p.first >= d) {
				l = max(l, p.second);
				q_dif.pop();
			}
			else break;
		}
		while (!q_sum.empty()) {
			P p = q_sum.top();
			if (p.first >= s) {
				l = max(l, p.second);
				q_sum.pop();
			}
			else break;
		}
		ans += r - l - 1;
		q_dif.emplace(d, r), q_sum.emplace(s, r);
		r++;
	}
	cout << ans << endl;

	return 0;
}