import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

Q = int(readline())
m = map(int,read().split())
ABC = tuple(zip(m,m,m))

class BinaryIndexedTree():
    def __init__(self, seq):
        self.size = len(seq)
        self.depth = self.size.bit_length()
        self.build(seq)
        
    def build(self,seq):
        data = seq
        size = self.size
        for i,x in enumerate(data):
            j = i+(i&(-i))
            if j < size:
                data[j] += data[i]
        self.data = data
        
    def __repr__(self):
        return self.data.__repr__()
        
    def get_sum(self,i):
        data = self.data
        s = 0
        while i:
            s += data[i]
            i -= i & -i
        return s
 
    def add(self, i, x):
        data = self.data
        size = self.size
        while i < size:
            data[i] += x
            i += i & -i
    
    def find_kth_element(self,k):
        data = self.data; size = self.size
        x,sx = 0,0
        dx = 1 << (self.depth)
        for i in range(self.depth - 1, -1, -1):
            dx = (1 << i)
            if x + dx >= size:
                continue
            y = x + dx
            sy = sx + data[y]
            if sy < k:
                x,sx = y,sy
        return x + 1

X = []
for a,b,c in ABC:
    if a == 0:
        X.append(b)
    else:
        X.append(b)
        X.append(c)

x_rank = {x:i for i,x in enumerate(sorted(set(X)), 1)}

N = len(x_rank)

bit = BinaryIndexedTree([0] * (N+1))
answer = 0
for a,b,c in ABC:
    if a == 0:
        b = x_rank[b]
        bit.add(b,c)
    else:
        b = x_rank[b]
        c = x_rank[c]
        answer += bit.get_sum(c) - bit.get_sum(b-1)

print(answer)