class DynamicBIT:
    from collections import defaultdict
    def __init__(self, n):
        self.n = n + 1
        #self.d = self.defaultdict(int)
        self.d = [0] * self.n
    def add(self, i, x):
        i += 1
        while i <= self.n:
            self.d[i] += x
            i += i & -i
    
    def _sum(self, i):
        res = 0
        while i > 0:
            res += self.d[i]
            i -= i & -i
        return res
    
    def sum(self, l, r):
        return self._sum(r) - self._sum(l)

import sys
input=sys.stdin.readline

n=int(input())
T,X,Y=map(list,zip(*[map(int,input().split()) for _ in range(n)]))

zaatu=[]
for t,x,y in zip(T,X,Y):
    zaatu.append(x)
    if t==1:
        zaatu.append(y)
        zaatu.append(y+1)
zaatu={x:i for i,x in enumerate(sorted(set(zaatu)))}

bit=DynamicBIT(len(zaatu))
ans=0
for t,*query in zip(T,X,Y):
    if t==0:
        x,y=query
        bit.add(zaatu[x],y)
    else:
        l,r=query
        ans+=bit.sum(zaatu[l],zaatu[r]+1)
print(ans)