#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;

constexpr ll n = 1ll << 30; // 横幅

//template<typename T>
class DynamicSegmentTree {
private:
	//using F = function<T(T, T)>; // モノイド型
	//const F f;   // モノイド
	//const T e;   // モノイド単位元
	unordered_map<int, ll> data;

public:
	// init忘れに注意
	DynamicSegmentTree() {}

	void add_val(int idx, ll val) {
		idx += n - 1;
		if (data.find(idx) == data.end())data[idx] = 0;
		data[idx] += val;
		while (idx > 0) {
			idx = (idx - 1) / 2;
			int num = 2 * idx + 1;
			data[idx] =
				(data.find(num) == data.end() ? 0 : data[num]) +
				(data.find(num + 1) == data.end() ? 0 : data[num + 1]);
		}
	}

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

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

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

	ll res = 0;
	while (n--) {
		int com, x, y;
		scanf("%d %d %d", &com, &x, &y);
		//cin >> com >> x >> y;
		if (com == 0) {
			dst.add_val(x, y);
		}
		else {
			res += dst.query(x, y + 1);
		}
	}
	cout << res << endl;
	return 0;
}