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]

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 rs = new int[N];
      rs[] = N;
      foreach (phase; 0 .. 2) {
        alias Entry = Tuple!(long, "val", int, "id");
        auto es = new Entry[N];
        foreach (i; 0 .. N) {
          es[i] = Entry(phase ? (A[i] + B[i]) : (A[i] - B[i]), -i);
        }
        es.sort;
        auto set = new RedBlackTree!int;
        set.insert(N);
        foreach (e; es) {
          const i = -e.id;
          chmin(rs[i], set.upperBound(i).front);
          set.insert(i);
        }
      }
      debug {
        writeln("rs = ", rs);
      }
      
      long ans;
      {
        auto set = new RedBlackTree!(int, "a < b", true);
        set.insert(N);
        int j;
        foreach (i; 0 .. N) {
          for (; j < set.front; ++j) {
            set.insert(rs[j]);
          }
          ans += (j - i);
          set.removeKey(rs[i]);
        }
      }
      ans -= N;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}