import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }



/*
  |B[j] - B[i]| < A[j] - A[i]
  
  A[i]-B[i] < A[j]-B[j]
  A[i]+B[i] < A[j]+B[j]
*/

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto A = new long[N];
      foreach (i; 0 .. N) A[i] = readLong;
      auto B = new long[N];
      foreach (i; 0 .. N) B[i] = readLong;
      
      auto fs = new bool[N - 1];
      foreach (i; 0 .. N - 1) {
        fs[i] = (abs(B[i + 1] - B[i]) < A[i + 1] - A[i]);
      }
      debug {
        writeln("fs = ", fs);
      }
      
      long ans;
      for (int i = 0, j; i < N - 1; i = j) {
        for (j = i; j < N - 1 && fs[i] == fs[j]; ++j) {}
        if (fs[i]) {
          const long len = j - i + 1;
          ans += len * (len - 1) / 2;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}