#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

struct Ratio {
	long long num, den;
	Ratio() : num(0), den(1) {}
	Ratio(long long x, long long y) : num(x), den(y) { if(den < 0 || (den == 0 && num < 0)) num = -num, den = -den; }
	bool operator<(const Ratio &that) const { return (ll)num * that.den < (ll)that.num * den; }
	bool operator<=(const Ratio &that) const { return (ll)num * that.den <= (ll)that.num * den; }
	bool operator==(const Ratio &that) const { return (ll)num * that.den == (ll)that.num * den; }
	Ratio operator+(const Ratio &that) const {
		return Ratio(num * that.den + that.num * den, den * that.den);
	}
	Ratio operator-(const Ratio &that) const {
		return Ratio(num * that.den - that.num * den, den * that.den);
	}
};

int main() {
	int N;
	while(~scanf("%d", &N)) {
		vector<Ratio> segments[3];
		rep(p, 3)
			segments[p].emplace_back(1, 1);
		rep(i, N) {
			int p; int a; int b;
			scanf("%d%d%d", &p, &a, &b);
			segments[p].emplace_back(a, a + b);
		}
		rep(p, 3)
			sort(segments[p].begin(), segments[p].end());
		auto ge1 = [](Ratio a, Ratio b) {
			return (ll)a.num * b.den + (ll)b.num * a.den >= (ll)a.den * b.den;
		};
		ll ans = 0;
		for(auto s : segments[0]) {
			int n = (int)segments[2].size();
			int jR = n;
			int jL = n;
			int j1 = n, j2 = n;
			Ratio val1 = Ratio(1, 1) - s;
			for(; j1 > 0 && val1 <= segments[2][j1 - 1]; -- j1);
			for(auto t : segments[1]) {
				Ratio val = Ratio(2, 1) - (s + t);
				for(; jR > 0 && val < segments[2][jR - 1]; -- jR);
				ans += (int)segments[2].size() - jR;

				Ratio val2 = Ratio(1, 1) - t;
				for(; jL > 0 && val <= segments[2][jL - 1]; -- jL);
				for(; j2 > 0 && val2 <= segments[2][j2 - 1]; -- j2);
				if(Ratio(1, 1) <= s + t) {
					int L = max(j1, j2), R = jL;
					if(L < R)
						ans += R - L;
				}
			}
		}
		printf("%lld\n", ans);
	}
	return 0;
}