#include"bits/stdc++.h"
using namespace std;
#define REP(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) REP((i),0,(n))
using ll = long long;


template<typename T>
class DynamicSegmentTree {
private:
	using F = function<T(T, T)>; // モノイド型
	const static ll n = 1ll << 32; // 横幅
	const F f;   // モノイド
	const T e;   // モノイド単位元
	map<ll, T> data;

	// 存在しないindexではeを返します
	T at(ll idx) {
		return data.find(idx) == data.end() ? e : data[idx];
	}

public:
	// init忘れに注意
	DynamicSegmentTree(F f, T e) :f(f), e(e) {}

	void set_val(ll idx, T val) {
		idx += n - 1;
		data[idx] = val;
		while (idx > 0) {
			idx = (idx - 1) / 2;
			data[idx] = f(
				at(2 * idx + 1),
				at(2 * idx + 2)
			);
		}
	}

	T query(ll a, ll b, ll k = 0, ll l = 0, ll r = n) {
		if (r <= a || b <= l)return e;
		if (a <= l && r <= b) {
			return data.find(k) == data.end() ? e : data[k];
		}
		else {
			T vl = data.find(2 * k + 1) == data.end()
				? e
				: query(a, b, 2 * k + 1, l, (l + r) / 2);
			T vr = data.find(2 * k + 2) == data.end()
				? e
				: query(a, b, 2 * k + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
};

int main()
{
	int n;
	cin >> n;

	function<ll(ll, ll)> f = [](ll a, ll b) {return a + b; };
	DynamicSegmentTree<ll> dst(f, 0);

	ll res = 0;
	while (n--) {
		int com, x, y;
		cin >> com >> x >> y;
		if (com == 0) {
			ll now = dst.query(x, x + 1);
			dst.set_val(x, now + y);
		}
		else {
			res += dst.query(x, y + 1);
		}
	}
	cout << res << endl;
	return 0;
}