N = int(input())
Q = [tuple(map(int,input().split())) for i in range(N)]
xs = set()
for a,b,c in Q:
    if a == 0:
        xs.add(b)
    else:
        xs.add(b)
        xs.add(c)
order = {x:i for i,x in enumerate(sorted(xs))}

L = len(xs)

bit = [0] * (L+1)
def bit_add(a,w):
    x = a
    while x <= L:
        bit[x] += w
        x += (x & -x)

def bit_sum(a):
    x = a
    ret = 0
    while x > 0:
        ret += bit[x]
        x -= (x & -x)
    return ret

ans = 0
for a,b,c in Q:
    if a == 0:
        x = order[b]
        bit_add(x+1,c)
    else:
        l = order[b]
        r = order[c]
        ans += bit_sum(r+1) - bit_sum(l)
print(ans)