class DynamicBIT:
    from collections import defaultdict
    def __init__(self, n):
        self.n = n + 1
        self.d = self.defaultdict(int)
    
    def add(self, i, x):
        i += 1
        while i <= self.n:
            self.d[i] += x
            i += i & -i
    
    def _sum(self, i):
        res = 0
        while i > 0:
            res += self.d[i]
            i -= i & -i
        return res
    
    def sum(self, l, r):
        return self._sum(r) - self._sum(l)

import sys
input=sys.stdin.readline

M=10**9
n=int(input())
bit=DynamicBIT(M)
ans=0
for _ in range(n):
    t,*query=map(int,input().split())
    if t==0:
        x,y=query
        bit.add(x,y)
    else:
        l,r=query
        ans+=bit.sum(l,r+1)
print(ans)