#line 1 "main.cpp"
#line 2 "main.cpp"
#include <cassert>
#include <memory>
namespace kyopro {
/// @brief 動的セグメント木
template <class S, S (*op)(S, S), S (*e)()>
class dynamic_segtree {
public:
    dynamic_segtree(size_t n = 0) : n(n), root(nullptr) {}

private:
    struct Node {
        S val;
        Node *l, *r, *parent;

        Node(const S& v = e(), Node* pt = nullptr)
            : val(v), l(nullptr), r(nullptr), parent(pt){}
    };
    using ptr = Node*;

    ptr root = nullptr;
    size_t n;

private:
    Node* find(size_t i) {
        assert(0 <= i && i < n);
        if (!root) {
            root = new Node();
        }

        size_t l = 0, r = n;

        ptr p = std::move(root);
        
        while (r - l > 1) {
            size_t md = (r + l) >> 1;
            if (i < md) {
                if (!p->l) {
                    p->l = new Node(e(), p);
                }
                p = std::move(p->l);
                r = md;
            } else {
                if (!p->r) {
                    p->r = new Node(e(), p);
                }
                p = std::move(p->r);
                l = md;
            }
        }
        return p;
    }
    void push(Node* p) {
        while (p = std::move(p->parent)) {
            p->val = op((p->l ? p->l->val : e()), (p->r ? p->r->val : e()));
        }
    }

public:
    void apply(size_t i, const S& x) {
        assert(0 <= i && i < n);
        auto p = find(i);
        p->val = op(p->val, x);
        push(std::move(p));
    }
    void update(size_t i, const S& x) {
        assert(0 <= i && i < n);
        auto p = find(i);
        p->val = x;
        push(std::move(p));
    }
    S prod(size_t l, size_t r) {
        assert(0 <= l && l <= r && r <= n);
        if (l == r) {
            return e();
        }
        return internal_prod(root, 0, n, l, r);
    }

private:
    S internal_prod(ptr& p, size_t l, size_t r, size_t L, size_t R) {
        if (p == nullptr || r <= L || R <= l) {
            return e();
        }
        if (L <= l && r <= R) {
            return p->val;
        }

        size_t mid = (l + r) >> 1;
        return op(internal_prod(p->l, l, mid, L, R),
                  internal_prod(p->r, mid, r, L, R));
    }
};
};  // namespace kyopro

/// @docs docs/data-structure/dynamic_segtree.md
#include <iostream>
constexpr inline int op(int x, int y) { return x + y; }
constexpr inline int e() { return 0; }
int main() {
    const size_t n = 1000000001;
    kyopro::dynamic_segtree<int, op, e> seg(n);

    int q;
    std::cin >> q;
    long long ans = 0;
    while (q--) {
        int type;
        std::cin >> type;
        if (type == 0) {
            size_t x;
            long long y;
            std::cin >> x >> y;
            seg.apply(x, y);
        } else {
            size_t l, r;
            std::cin >> l >> r;
            ans += seg.prod(l, r + 1);
        }
    }
    std::cout << ans << '\n';
}