class Bit:
    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)

    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

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


N = int(input())
TXY = [list(map(int, input().split())) for _ in range(N)]
A = set()
for t, x, y in TXY:
    A.add(x)
    if t == 1:
        A.add(y)

NA = len(A)
ft = Bit(NA)
A = sorted(list(A))
dic = dict(zip(A, range(NA)))
ans = 0
for t, x, y in TXY:
    if t == 0:
        ft.add(dic[x], y)
    else:
        ans += ft.sum(dic[y])
        if dic[x] > 0:
            ans -= ft.sum(dic[x] - 1)
print(ans)