#include<bits/stdc++.h>
using namespace std;
struct SegmentTree{
  private:
  int n; vector<long long> node;
  public:
  SegmentTree(vector<long long> v){
    int sz=(int)v.size();
    n=1; while(n<sz)n*=2;
    node.resize(2*n-1,0);
    for(int i=0;i<sz;i++)node[i+n-1]=v[i];
    for(int i=n-2;i>=0;i--)node[i]=node[2*i+1]+node[2*i+2];
  }
  void add(long long k,long long val){
    k+=n-1;
    node[k]+=val;
    while(k > 0) {
            k = (k - 1) / 2;
            node[k] = node[2*k+1] + node[2*k+2];
        }
    }
 
    long long getsum(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        if(b <= l || r <= a) return 0;
        if(a <= l && r <= b) return node[k];
 
        long long vl = getsum(a, b, 2*k+1, l, (l+r)/2);
        long long vr = getsum(a, b, 2*k+2, (l+r)/2, r);
        return vl + vr;
    }
};
 
int main() {
  int n;
  cin >> n;
  long long ans=0,w=0;
  SegmentTree seg(vector<long long>(n,w));
  for(int i=0;i<n;i++){
    long long q,s,t; cin >> q >> s >> t;
    if(q==0){seg.add(s,t);}
    else{ans+=seg.getsum(s,t+1);}
  }
  cout << ans << endl;
}