import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(input())

size = N


ans = 0
nums = set()
cnt = 0
query = []
for _ in range(N):
    q, l, r = list(map(int, input().split()))
    query.append([q, l, r])

    if q == 0:
        nums.add(l)
    else:
        nums.add(l)
        nums.add(r+1)

num2Id = {}
for i, n in enumerate(list(sorted(nums))):
    num2Id[n] = i

L = [0]*(len(nums)+1)


def sum(self, r):
    """
    calc sum from L[0] to L[r-1]
    """
    ret = 0
    while r > 0:
        ret += self.L[r]
        r -= r & (-r)

    return ret


def range_sum(self, l, r):
    """
    calc sum from L[l] to L[r-1]
    """
    return self.sum(r)-self.sum(l)


def add(self, i, x):
    """
    L[i] += x
    """
    while i < self.size:
        self.L[i] += x


for q, l, r in query:
    if q == 0:
        add(num2Id[l], r)
    else:
        ans += range_sum(num2Id[l], num2Id[r+1])
print(ans)