import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N = int(input())
A = li()
B = li()

r = -1
M = []
del_M = []
m = []
del_m = []
res = 0
for l in range(N):
    if r==l-1:
        heappush(M,-(A[l]+B[l]))
        heappush(m,-(A[l]-B[l]))
        r = l
    while del_M and M[0]==del_M[0]:
        heappop(M)
        heappop(del_M)
    while del_m and m[0]==del_m[0]:
        heappop(m)
        heappop(del_m)
    while r!=N-1:
        if -M[0] < A[r+1]+B[r+1] and -m[0] < A[r+1]-B[r+1]:
            heappush(M,-(A[r+1]+B[r+1]))
            heappush(m,-(A[r+1]-B[r+1]))
            r += 1
        else:
            break
    
    res += r-l

print(res)