import typing

class FenwickTree:
    '''Reference: https://en.wikipedia.org/wiki/Fenwick_tree'''

    def __init__(self, n: int = 0) -> None:
        self._n = n
        self.data = [0] * n

    def add(self, p: int, x: typing.Any) -> None:
        assert 0 <= p < self._n

        p += 1
        while p <= self._n:
            self.data[p - 1] += x
            p += p & -p

    def sum(self, left: int, right: int) -> typing.Any:
        assert 0 <= left <= right <= self._n

        return self._sum(right) - self._sum(left)

    def _sum(self, r: int) -> typing.Any:
        s = 0
        while r > 0:
            s += self.data[r - 1]
            r -= r & -r

        return s

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 = FenwickTree(NA)
B = sorted(list(A))
dic = dict(zip(B,range(NA)))
base = [0] * NA

ans = 0
for t,x,y in TXY:
    if t == 0:
        ft.add(dic[x],y)
    else:
        ans += ft.sum(dic[x],dic[y]+1)
print(ans)