class SegTree:
    """
    init(init_val, ide_ele): 配列init_valで初期化 O(N)
    update(k, x): k番目の値をxに更新 O(logN)
    query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
    """
    def __init__(self, init_val, segfunc, ide_ele):
        """
        init_val: 配列の初期値
        segfunc: 区間にしたい操作
        ide_ele: 単位元
        n: 要素数
        num: n以上の最小の2のべき乗
        tree: セグメント木(1-index)
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        """
        k番目の値をxに更新
        k: index(0-index)
        x: update value
        """
        k += self.num
        self.tree[k] = x
        while k > 1:
            self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
            k >>= 1

    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る
        l: index(0-index)
        r: index(0-index)
        """
        res = self.ide_ele

        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res = self.segfunc(res, self.tree[l])
                l += 1
            if r & 1:
                res = self.segfunc(res, self.tree[r - 1])
            l >>= 1
            r >>= 1
        return res
    def value(self,index):
        return self.query(index,index+1)
from collections import defaultdict
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
dis = []
plus = []
for i in range(N):
    dis.append(A[i] -B[i])
    plus.append(B[i] + A[i])
dis = list(set(dis))
plus = list(set(plus))
dis.sort()
plus.sort()
disindex= defaultdict(int)
plusindex = defaultdict(int)
segdis = SegTree([-1] * len(dis),lambda x,y:max(x,y),-1)
segplus = SegTree([-1] * len(plus),lambda x,y:max(x,y),-1)
for i,v in enumerate(dis):
    disindex[v] = i
for i,v in enumerate(plus):
    plusindex[v] = i
ans = 0
for i in range(N):
    a = A[i]
    b = B[i]
    nowindex = disindex[a -b]
    l1 = segdis.query(nowindex,len(dis))
    segdis.update(nowindex,i)
    nowindex = plusindex[b+a]
    l2 = segplus.query(nowindex,len(plus))
    segplus.update(nowindex,i)
    l = max(l1,l2)
    ans += i - l -1
print(ans)