#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr int INF = 2001001001;

int op1(int x, int y) { return max(x, y); }
int e1() { return -INF; }

int op2(int x, int y) { return min(x, y); }
int e2() { return INF; }

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n), b(n);
  rep(i, n) cin >> a[i];
  rep(i, n) cin >> b[i];
  vector<int> ord(n);
  iota(ord.begin(), ord.end(), 0);
  sort(ord.begin(), ord.end(), [&](int i, int j) {
    return b[i] < b[j];
  });
  segtree<int, op1, e1> seg1(n);
  segtree<int, op2, e2> seg2(n);
  VI evs(n + 2, -1);
  for(int i: ord) {
    int l = seg1.min_left(i, [&](int x) { return x < a[i] - b[i]; });
    int r = seg2.max_right(i + 1, [&](int x) { return x > a[i] + b[i]; });
    chmax(evs[i + 1], l);
    chmax(evs[r + 1], i + 1);
    seg1.set(i, a[i] - b[i]);
    seg2.set(i, a[i] + b[i]);
  }
  ll ans = 0;
  int mnl = 0;
  for(int i = 1; i <= n; i++) {
    chmax(mnl, evs[i]);
    int cnt = i - mnl;
    if (cnt > 1) ans += cnt - 1;
  }
  cout << ans << '\n';
}