N = int(input())

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

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

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

    def subtract(self, i, x):
        i += 1
        while i <= self.size:
            self.bit[i] -= x
            i += i & -i

q = [0] * N
for i in range(N):
    q[i] = list(map(int, input().split()))

s = set()
for i in range(N):
    if q[i][0] == 0:
        s.add(q[i][1])
    else:
        s.add(q[i][1])
        s.add(q[i][2])

s = sorted(s)
l = len(s)
d = dict()
for i in range(len(s)):
    d[s[i]] = i

del s

s = BinaryIndexedTree(l)

ans = 0
for i in range(N):
    if q[i][0] == 0:
        x = d[q[i][1]]
        s.add(x, q[i][2])
    else:
        l = d[q[i][1]]
        r = d[q[i][2]]
        ans += s.sum(r+1) - s.sum(l)
    
print(ans)