class Fenwick_Tree: def __init__(self, n): self._n = n self.data = [0] * n def add(self, p, x): assert 0 <= p < self._n p += 1 while p <= self._n: self.data[p - 1] += x p += p & -p def sum(self, l, r): assert 0 <= l <= r <= self._n return self._sum(r) - self._sum(l) def _sum(self, r): s = 0 while r > 0: s += self.data[r - 1] r -= r & -r return s def get(self, k): k += 1 x, r = 0, 1 while r < self._n: r <<= 1 len = r while len: if x + len - 1 < self._n: if self.data[x + len - 1] < k: k -= self.data[x + len - 1] x += len len >>= 1 return x from bisect import * from copy import deepcopy def compress(lst): """ B: lstを座圧したリスト D: 元の値からindexを取得する辞書 vals: indexから元の値を取得するリスト """ B = [] vals = deepcopy(lst) vals = list(set(vals)) vals.sort() for i in range(len(lst)): ind = bisect_left(vals, lst[i]) B.append(ind) return B, vals N = int(input()) Q = [] for i in range(N): Q.extend(list(map(int, input().split()))) Q, vals = compress(Q) T = Fenwick_Tree(len(vals)) ans = 0 for i in range(N): q, x, y = Q[3 * i], Q[3 * i + 1], Q[3 * i + 2] if q == 0: T.add(x, y) else: ans += T.sum(x, y + 1) print(ans)