#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from bisect import bisect_left, bisect_right


class BinaryIndexedTree():
    def __init__(self, seq):
        self.size = len(seq)
        self.depth = self.size.bit_length()
        self.build(seq)

    def build(self, seq):
        data = seq
        size = self.size
        for i, x in enumerate(data):
            j = i + (i & (-i))
            if j < size:
                data[j] += data[i]
        self.data = data

    def __repr__(self):
        return self.data.__repr__()

    def get_sum(self, i):
        data = self.data
        s = 0
        while i:
            s += data[i]
            i -= i & -i
        return s

    def add(self, i, x):
        data = self.data
        size = self.size
        while i < size:
            data[i] += x
            i += i & -i

    def find_kth_element(self, k):
        data = self.data
        size = self.size
        x, sx = 0, 0
        dx = 1 << (self.depth)
        for i in range(self.depth - 1, -1, -1):
            dx = (1 << i)
            if x + dx >= size:
                continue
            y = x + dx
            sy = sx + data[y]
            if sy < k:
                x, sx = y, sy
        return x + 1


N = int(readline())
A = tuple(map(int, readline().split()))
m = map(int, read().split())
LR = zip(m, m)

remove_x = [[] for _ in range(N + 10)]
bit = BinaryIndexedTree([0] * (N + 10))
answer = 0
total = 0
for i, (a, (l, r)) in enumerate(zip(A, LR), 1):
    for x in remove_x[i]:
        bit.add(x, -1)
        total -= 1
    n = bisect_left(A, a - l)
    m = bisect_right(A, a + r) + 1
    answer += total - bit.get_sum(n)
    remove_x[m].append(i)
    bit.add(i, 1)
    total += 1

print(answer)