import sys
input = sys.stdin.readline

Q = []
P = []
n = int(input())
for i in range(n):
    c, x, y = map(int, input().split())
    Q.append((c, x, y))
    if c == 0:
        P.append(x)
    else:
        P.append(x)
        P.append(y)

P = list(set(P))
P.sort()
d = {}
import bisect
for p in P:
    d[p] = bisect.bisect_left(P, p)+1

m = len(P)
bit = [0]*(m+1)

def bit_query(i):
    res = 0
    while i > 0:
        res += bit[i]
        i -= i & (-i)
    return res

def bit_update(i, x):
    while i <= m:
        bit[i] += x
        i += i & (-i)

ans = 0
for i in range(n):
    c, x, y = Q[i]
    if c == 0:
        bit_update(d[x], y)
    else:
        ans += bit_query(d[y])-bit_query(d[x]-1)
print(ans)