def solve(n, A, B):
    tf = [0] * n
    for i in range(n - 1):
        if A[i] + max(B[i], B[i + 1]) < A[i + 1] + min(B[i], B[i + 1]):
            tf[i] = 1
    for i in range(1, n):
        if tf[i]:
            tf[i] += tf[i - 1]
    return sum(tf)


n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
print(solve(n, A, B))
exit()
def stupid(n, A, B):
    ans = 0
    for l in range(n):
        for r in range(l + 1, n):
            ok = True
            for ll in range(l, r + 1):
                for rr in range(ll + 1, r + 1):
                    if A[ll] + max(B[rr], B[ll]) >= A[rr] + min(B[ll], B[rr]):
                        ok = False
                        break
                if not ok:
                    break
            ans += ok
    return ans

import random
random.seed(0)
for _ in range(100):
    n = 10
    A = random.sample(range(1, 20), k=n)
    A.sort()
    B = random.choices(range(1, 20), k=n)
    assert solve(n, A, B) == stupid(n, A, B), (n, A, B, solve(n, A, B), stupid(n, A, B))