#include<stdio.h>
long long int h[200005], l;
int comp_h(long long int a, long long int b)
{
	if (h[a] > h[b])
		return 1;
	else
		return -1;
}
void swap_h(long long int a, long long int b)
{
	long long int f = h[a];
	h[a] = h[b];
	h[b] = f;
	return;
}
void push(long long int ne)
{
	h[l] = ne;
	long long int p = l;
	l++;
	for (; p > 0; p = (p - 1) / 2)
		if (comp_h((p - 1) / 2, p) > 0)
			swap_h((p - 1) / 2, p);
	return;
}
long long int pop()
{
	l--;
	swap_h(0, l);
	long long int p = 0;
	for (;;)
	{
		if (2 * p + 2 < l)
		{
			if (comp_h(2 * p + 1, 2 * p + 2) > 0)
			{
				if (comp_h(p, 2 * p + 2) > 0)
					swap_h(p, 2 * p + 2);
				p = 2 * p + 2;
			}
			else
			{
				if (comp_h(p, 2 * p + 1) > 0)
					swap_h(p, 2 * p + 1);
				p = 2 * p + 1;
			}
		}
		else if (2 * p + 1 < l)
		{
			if (comp_h(p, 2 * p + 1) > 0)
				swap_h(p, 2 * p + 1);
			p = 2 * p + 1;
		}
		else
			break;
	}
	return h[l];
}
long long int a[200005], b[200005], t[200005];
long long int x[200005], y[200005], xx, yy;
long long int fined_left(long long int Y)
{
	long long int min, mid, max;
	min = -1;
	max = yy;
	while (max - min > 1)
	{
		mid = (max + min) / 2;
		if (y[mid] < Y)
			min = mid;
		else
			max = mid;
	}
	return min;
}
long long int fined_right(long long int Y)
{
	long long int min, mid, max;
	min = -1;
	max = yy;
	while (max - min > 1)
	{
		mid = (max + min) / 2;
		if (y[mid] <= Y)
			min = mid;
		else
			max = mid;
	}
	return min;
}
int main()
{
	long long int n;
	scanf("%lld", &n);
	long long int i;
	for (i = 0; i < n; i++)
		scanf("%lld %lld %lld", &a[i], &b[i], &t[i]);
	l = 0;
	for (i = 0; i < n; i++)
		if (a[i] == 0)
			push(b[i] - t[i]);
	for (xx = 0; l > 0; xx++)
		x[xx] = pop();
	l = 0;
	for (i = 0; i < n; i++)
		if (a[i] == 1)
			push(b[i] - t[i]);
	for (yy = 0; l > 0; yy++)
		y[yy] = pop();
	long long int ans = 0;
	for (i = 0; i < xx; i++)
		ans += fined_right(x[i]) - fined_left(x[i]);
	printf("%lld\n", ans);
	return 0;
}