#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n), b(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> b[i];
	vector<bool>c(n - 1);
	rep(i, n - 1) {
		int x = a[i] + max(b[i], b[i + 1]);
		int y = a[i + 1] + min(b[i], b[i + 1]);
		if (x >= y)c[i] = false;
		else c[i] = true;
	}
	long long ans = 0;
	int i = 0;
	for (; i < n - 1; ++i) {
		if (!c[i])continue;
		int j = i;
		while ((j < n - 1) && (c[j])) {
			j++;
		}
		long long x = j - i;
		ans += x * (x + 1) / 2;
		//cout << i << " " << j << endl;
		i = j;

	}
	//rep(i, n - 1) cout << c[i] << "_";
	cout << ans << endl;
	return 0;
}