#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<int> B(N);
  for (int i = 0; i < N; i++){
    cin >> B[i];
  }
  vector<int> P;
  P.push_back(0);
  for (int i = 1; i < N; i++){
    if (!(A[i - 1] + B[i - 1] < A[i] + B[i] && A[i - 1] - B[i - 1] < A[i] - B[i])){
      P.push_back(i);
    }
  }
  P.push_back(N);
  int cnt = P.size() - 1;
  long long ans = 0;
  for (int i = 0; i < cnt; i++){
    ans += (long long) (P[i + 1] - P[i]) * (P[i + 1] - P[i] - 1) / 2;
  }
  cout << ans << endl;
}