from collections import deque

def aa(m,seg):
    while m>1:
        m//=2
        seg[m]=max(seg[m*2],seg[m*2+1])
def bb(l,r,seg):
    res=-1<<60
    while l<r:
        if l&1:
            res=max(res,seg[l]);l+=1
        if r&1:
            r-=1;res=max(res,seg[r])
        l//=2;r//=2
    return res

n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
s=set(b)
v=1<<len(s).bit_length()
y={};p=0
for i in sorted(list(s)):
    y[i]=p+v;p+=1
c=[deque() for i in range(len(s))]
d=[deque() for i in range(len(s))]
seg1=[0]*v*2;ans=0
seg2=[-1<<60]*v*2;q=0
for i in range(n):
    while q<n:
        j,l=a[q],b[q]
        if bb(v,y[l],seg2)>=j-l or bb(y[l],v*2,seg1)>=l+j:
            break
        q+=1
        k=y[l]-v
        while c[k] and c[k][-1]<j-l:
            c[k].popleft()
        c[k].append(j-l)
        seg2[k+v]=c[k][0];aa(k+v,seg2)
        while d[k] and d[k][-1]<l+j:
            d[k].popleft()
        d[k].append(l+j)
        seg1[k+v]=d[k][0];aa(k+v,seg1)
    ans+=q-i-1
    k=y[b[i]]-v
    j,l=a[i],b[i]
    if c[k][0]==j-l:
        c[k].popleft()
        if c[k]:
            seg2[k+v]=c[k][0];aa(k+v,seg2)
        else:
            seg2[k+v]=-1<<60;aa(k+v,seg2)
    if d[k][0]==j+l:
        d[k].popleft()
        if d[k]:
            seg1[k+v]=d[k][0];aa(k+v,seg1)
        else:
            seg1[k+v]=0;aa(k+v,seg1)
print(ans)