//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pli = pair<ll,int>;
#define MOD 998244353
//#define MOD 1000000007
#define el '\n'
#define El '\n'
#define YESNO(x) ((x) ? "Yes" : "No")
#define YES YESNO(true)
#define NO YESNO(false)
#define EXIT_ANS(x) {cout << (x) << '\n'; return;}
#define PA() {EXIT_ANS(ans);}
template <typename T> void inline SORT(vector<T> &v){sort(v.begin(),v.end()); return;}
template <typename T> void inline REV(vector<T> &v){reverse(v.begin(),v.end()); return;}
template <typename T> void inline VEC_UNIQ(vector<T> &v){sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); return;}
template <typename T> T inline MAX(vector<T> &v){return *max_element(v.begin(),v.end());}
template <typename T> T inline MIN(vector<T> &v){return *min_element(v.begin(),v.end());}
template <typename T> T inline SUM(vector<T> &v){T ans = 0; for(int i = 0; i < (int)v.size(); i++)ans += v[i]; return ans;}
template <typename T> void inline DEC(vector<T> &v){for(int i = 0; i < (int)v.size(); i++)v[i]--; return;}
template <typename T> void inline INC(vector<T> &v){for(int i = 0; i < (int)v.size(); i++)v[i]++; return;}
void inline TEST(void){cerr << "TEST" << endl; return;}
template <typename T> bool inline chmin(T &x,T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}
template <typename T> bool inline chmax(T &x,T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template <typename T = long long> vector<T> inline get_vec(int n){
    vector<T> ans(n);
    for(int i = 0; i < n; i++)cin >> ans[i];
    return ans;
}
template <typename T> void inline print_vec(vector<T> &vec,bool kaigyou = false){
    int n = (int)vec.size();
    for(int i = 0; i < n; i++){
        cout << vec[i];
        if(kaigyou || i == n - 1)cout << '\n';
        else cout << ' ';
    }
    if(!n)cout << '\n';
    return;
}
template <typename T> void inline debug_vec(vector<T> &vec,bool kaigyou = false){
    int n = (int)vec.size();
    for(int i = 0; i < n; i++){
        cerr << vec[i];
        if(kaigyou || i == n - 1)cerr << '\n';
        else cerr << ' ';
    }
    if(!n)cerr << '\n';
    return;
}
vector<vector<int>> inline get_graph(int n,int m = -1,bool direct = false){
    if(m == -1)m = n - 1;
    vector<vector<int>> g(n);
    while(m--){
        int u,v;
        cin >> u >> v;
        u--; v--;
        g[u].push_back(v);
        if(!direct)g[v].push_back(u);
    }
    return g;
}
template <typename T> vector<vector<pair<T,int>>> inline get_weighted_graph(int n,int m = -1,bool direct = false){
    if(m == -1)m = n - 1;
    vector<vector<pair<T,int>>> g(n);
    while(m--){
        int u,v;
        cin >> u >> v;
        u--; v--;
        ll w; cin >> w;
        g[u].push_back(pair(w,v));
        if(!direct)g[v].push_back(pair(w,u));
    }
    return g;
}

//動的セグ木 
template <typename T> class ococo_dynamic_segtree {
public:
    T e = 0;
    T func(T a, T b) {
        // ここに演算を入れる
        return (a + b);
    }

    //ab 本来知りたい区間(閉区間)
    T get_minimum2(ll a, ll b, int idx) {
        if(a <= left[idx] && right[idx] <= b) return rmq[idx];
        else if(right[idx] < a || b < left[idx]) return e;
        else return func(left_child[idx] == -1 ? e : get_minimum2(a, b, left_child[idx]), right_child[idx] == -1 ? e : get_minimum2(a, b,right_child[idx]));
    }

    //点 i の左側の子を作る
    void make_left(int i){
        assert(left[i] != right[i]);
        int idx = (int)rmq.size();
        left_child[i] = idx;

        rmq.push_back(e);
        left_child.push_back(-1);
        right_child.push_back(-1);
        par.push_back(i);
        left.push_back(left[i]);
        right.push_back((left[i] + right[i]) / 2);
    }

    //点 i の右側の子を作る
    void make_right(int i){
        assert(left[i] != right[i]);
        int idx = (int)rmq.size();
        right_child[i] = idx;

        rmq.push_back(e);
        left_child.push_back(-1);
        right_child.push_back(-1);
        par.push_back(i);
        left.push_back((left[i] + right[i]) / 2 + 1);
        right.push_back(right[i]);
    }

    int update_num2(ll a,int idx,ll x){
        if(a == left[idx] && right[idx] == a){
            rmq[idx] = x;
            return idx;
        }
        if(right[idx] < a || a < left[idx])return -1;

        if(a <= (left[idx] + right[idx]) / 2){
            if(left_child[idx] == -1)make_left(idx);
            return update_num2(a,left_child[idx],x);
        }
        if(a > (left[idx] + right[idx]) / 2){
            if(right_child[idx] == -1)make_right(idx);
            return update_num2(a,right_child[idx],x);
        }
        return -1;
    }
    int add_num2(ll a,int idx,ll x){
        if(a == left[idx] && right[idx] == a){
            rmq[idx] += x;
            return idx;
        }
        if(right[idx] < a || a < left[idx])return -1;

        if(a <= (left[idx] + right[idx]) / 2){
            if(left_child[idx] == -1)make_left(idx);
            return add_num2(a,left_child[idx],x);
        }
        if(a > (left[idx] + right[idx]) / 2){
            if(right_child[idx] == -1)make_right(idx);
            return add_num2(a,right_child[idx],x);
        }
        return -1;
    }

    int n;
    vector<T> rmq;
    vector<int> left_child,right_child,par;
    //自分が持っている範囲。閉区間
    vector<ll> left,right;

public:

    //(データの大きさ,単位元)
    ococo_dynamic_segtree(ll N) {
        syokica(N);
    }

    // 配列の初期化 O(N)
    void syokica(ll a) {
        n = 1;
        while(n < a) n *= 2;
        rmq.push_back(e);
        par.push_back(-1);
        left_child.push_back(-1); right_child.push_back(-1);
        left.push_back(0);
        right.push_back(n - 1);
    }

    // a[i]をxにする O(logN)
    void update_num(ll i, T x) {
        int idx = update_num2(i,0,x);
        while(1){
            idx = par[idx];
            if(idx == -1)break;
            rmq[idx] = func(left_child[idx] == -1 ? e : rmq[left_child[idx]], right_child[idx] == -1 ? e : rmq[right_child[idx]]);
        }
        return;
    }

    // a[i]にxを加える O(logN)
    void add_num(int i, T x) {
        int idx = add_num2(i,0,x);
        while(1){
            idx = par[idx];
            if(idx == -1)break;
            rmq[idx] = func(left_child[idx] == -1 ? e : rmq[left_child[idx]], right_child[idx] == -1 ? e : rmq[right_child[idx]]);
        }
        return;
    }

    
    //[l,r]の区間演算の取得 O(logN)
    T get_val(int l, int r) {
        return get_minimum2(l,r,0);
    }
};


#define MULTI_TEST_CASE false
void solve(void){
    //問題を見たらまず「この問題設定から言えること」をいっぱい言う
    //よりシンプルな問題に言い換えられたら、言い換えた先の問題を自然言語ではっきりと書く
    //複数の解法のアイデアを思いついた時は全部メモしておく
    //g++ -D_GLIBCXX_DEBUG -Wall -O2 make_library.cpp -o o
    int q; cin >> q;
    ococo_dynamic_segtree<ll> sgt(1e9+1);
    ll ans = 0;
    while(q--){
        int t; cin >> t;
        if(t == 0){
            int p; ll x;
            cin >> p >> x;
            sgt.add_num(p,x);
        }
        if(t == 1){
            int l,r; cin >> l >> r;
            ans += sgt.get_val(l,r);
        }
    }
    cout << ans << el;
    return;
}

void calc(void){
    return;
}

signed main(void){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    calc();
    int t = 1;
    if(MULTI_TEST_CASE)cin >> t;
    while(t--){
        solve();
    }
    return 0;
}