#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

template <typename M> class DynamicSegmentTree{
  using Op = function<M(M,M)>;
  class Node{
  public:
    M val;
    Node *left = nullptr, *right = nullptr;
    Node(const M &val): val(val) {}
  };
  
  Node *root = nullptr;
  LLI size;
  M zero;
  Op op;
  unordered_map<LLI, Node*> umap;

  Node* _update(Node *node, LLI l, LLI r, LLI pos, const M &val){
    LLI m = (l+r)/2;
    if(r-l == 1){
      if(node) node->val = op(node->val, val);
      else node = new Node(val);
      umap[pos] = node;
    }else{
      if(!node) node = new Node(val);
      if(pos<m) node->left = _update(node->left, l, m, pos, val);
      else node->right = _update(node->right, m, r, pos, val);
      node->val = op((node->left ? (node->left)->val : zero), (node->right ? (node->right)->val : zero));
    }
    return node;
  }

  M _query(Node* node, LLI l, LLI r, LLI x, LLI y){
    if(!node) return zero;
    LLI m = (l+r)/2;
    if(x <= l && r <= y) return node ? node->val : zero;
    if(r < x || y < l) return zero;
    return op(_query(node->left, l, m, x, y), _query(node->right, m, r, x, y));
  }

public:
  DynamicSegmentTree(LLI n, const M &zero, const Op &op): size(pow(2,ceil(log2(n)))), zero(zero), op(op){ // [0,n)
    root = new Node(zero);
  }

  void update(LLI i, const M &x){
    _update(root, 0, size, i, x);
  }

  M get(LLI x, LLI y){
    return _query(root, 0, size, x, y);
  }

  M operator[](LLI i) const{
    if(umap.find(i) != umap.end()) return umap[i]->val;
    else return zero;
  }
};


int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  while(cin >> n){

    DynamicSegmentTree<LLI> seg(1000000001, 0, [](LLI a, LLI b){return a+b;});

    LLI ans = 0;
    
    REP(i,n){
      int q,x,y; cin >> q >> x >> y;
      if(q == 0){
        seg.update(x,y);
      }else{
        ans += seg.get(x,y+1);
      }
    }

    cout << ans << endl;
  }
  
  return 0;
}