from collections import defaultdict
import sys
input = sys.stdin.readline
#print = sys.stdout.write
class SegTree:
    def __init__(self,N,op,identity):
        self.op = op
        self.identity = identity
        self.N = N
        self.data = defaultdict(lambda: identity)
    def __getitem__(self,key):
        key += self.N
        return self.data[key]
    def build(self,A):
        for i in range(self.N):
            self.data[self.N+i] = A[i]
        for i in range(self.N-1,0,-1):
            self.data[i] = self.op(self.data[i<<1|0],self.data[i<<1|1])
    def set_value(self,x,val):
        x += self.N
        self.data[x] = val
        while x > 1:
            x >>= 1
            self.data[x] = self.op(self.data[x<<1|0],self.data[x<<1|1])
    def fold(self,l,r):
        l,r = l+self.N,r+self.N
        lv,rv = self.identity,self.identity
        while l < r:
            if l&1:
                lv = self.op(lv,self.data[l])
                l += 1
            if r&1:
                r -= 1
                rv = self.op(self.data[r],rv)
            l,r = l>>1,r>>1
        return self.op(lv,rv)


seg = SegTree(1000000000,lambda x,y:x+y,0)
Q = int(input())
ans = 0
for _ in range(Q):
    op,x,y = map(int,input().split())
    if op == 0:
        seg.set_value(x,seg[x]+y)
    else:
        ans += seg.fold(x,y+1)
print(ans)