#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 int n = 1 << 30; // 横幅

class DynamicSegmentTree {
private:
	unordered_map<int, ll> data;

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

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

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

int main()
{
	int n;
	cin >> n;
	int com[100000], x[100000], y[100000];
	rep(i, n)scanf("%d %d %d", com + i, x + i, y + i);

	DynamicSegmentTree dst;
	ll res = 0;
	rep(i, n) {
		if (com[i]) {
			res += dst.query(x[i], y[i] + 1,0,0,n);
		}
		else {
			dst.add_val(x[i], y[i]);
		}
	}
	cout << res << endl;
	return 0;
}