#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

struct query {
	query(ll _q, ll _x, ll _y) :q(_q), x(_x), y(_y) {};
	ll q, x, y;
};

class BIT {
private:
	ll N;
	vector<ll> node;
public:
	BIT(ll M) {
		node = vector<ll>(M + 1, 0);
		N = M;
	}

	ll sum(ll i) {
		ll s = 0;
		while (i > 0) {
			s += node[i];
			i -= i & -i;
		}
		return s;
	}

	ll sum(ll i, ll j) {
		ll l = sum(i - 1);
		ll r = sum(j);
		return r - l;
	}

	void add(ll i, ll x) {
		while (i <= N) {
			node[i] += x;
			i += i & -i;
		}
	}
};


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll n; scanf("%lld", &n);
	map<ll, ll> mp;
	vector<query> vq;
	BIT bit(n * 5);
	for (ll i = 0; i < n; i++) {
		ll a, b, c; scanf("%lld %lld %lld", &a, &b, &c);
		if (a == 0) mp[b] = 0;
		else mp[b] = 0, mp[c] = 0;
		vq.emplace_back(a, b, c);
	}
	{
		ll idx = 1;
		for (auto itr = mp.begin(); itr != mp.end(); itr++) itr->second = idx++;
		for (ll i = 0; i < vq.size(); i++) {
			if (vq[i].q == 0) vq[i].x = mp[vq[i].x];
			else vq[i].x = mp[vq[i].x], vq[i].y = mp[vq[i].y];
		}
	}
	ll res = 0;
	for (ll i = 0; i < n; i++) {
		if (vq[i].q == 0) bit.add(vq[i].x, vq[i].y);
		else res += bit.sum(vq[i].x, vq[i].y);
	}
	cout << res << endl;
	return 0;
}