import heapq

def solve():
    n = int(input())
    a_values = list(map(int, input().split()))
    b_values = list(map(int, input().split()))

    a = []
    for i in range(n):
        a.append((a_values[i], b_values[i]))

    a.sort()

    q1 = []
    q2 = []

    heapq.heappush(q1, (- (a[0][0] + a[0][1]), 0))
    heapq.heappush(q2, (- (a[0][0] - a[0][1]), 0))

    ans = 0
    l = 0
    for r in range(1, n):
        while q1:
            c_fi, c_se = -q1[0][0], q1[0][1]
            if a[r][0] + a[r][1] <= c_fi:
                heapq.heappop(q1)
                l = max(l, c_se + 1)
            else:
                break
        heapq.heappush(q1, (- (a[r][0] + a[r][1]), r))

        while q2:
            c_fi, c_se = -q2[0][0], q2[0][1]
            if a[r][0] - a[r][1] <= c_fi:
                heapq.heappop(q2)
                l = max(l, c_se + 1)
            else:
                break
        heapq.heappush(q2, (- (a[r][0] - a[r][1]), r))
        ans += r - l

    print(ans)

solve()