#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T& v){v.erase(unique(ALL(v)),v.end());}
//debug
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

struct range{
	struct Iter{
		int v,step;
		Iter& operator++(){v+=step;return *this;}
		bool operator!=(Iter& itr){return v<itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	range(int i, int n,int step):i({i,step}), n({n,step}){}
	range(int i, int n):range(i,n,1){}
	range(int n):range(0,n){}
	Iter& begin(){return i;}
	Iter& end(){return n;}
};
struct rrange{
	struct Iter{
		int v,step;
		Iter& operator++(){v-=step;return *this;}
		bool operator!=(Iter& itr){return v>itr.v;}
		int& operator*(){return v;}
	};
	Iter i, n;
	rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
	rrange(int i, int n):rrange(i,n,1){}
	rrange(int n) :rrange(0,n){}
	Iter& begin(){return n;}
	Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<60;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-8;};
template<> inline long double EPS<long double>(){return 1e-8;};

// min{2^r | n < 2^r}
template<typename T> inline T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> inline T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}


ll gcd_positive(ll a,ll b) { return b == 0 ? a : gcd_positive(b,a%b); }
ll gcd(ll a,ll b) { return gcd_positive(abs(a), abs(b)); }

struct Ratio{
	ll a,b;// a/b
	Ratio(){}
	Ratio(ll a,ll b):a(a),b(b){ll gd =gcd(a,b);this->a/=gd,this->b/=gd;}
	bool operator < (const Ratio& r) const{
		if((b>=0) == (r.b>=0)) return a*r.b < r.a*b;
		return a*r.b > r.a*b;
	}
	bool operator <= (const Ratio& r) const{
		if((b>=0) == (r.b>=0)) return a*r.b <= r.a*b;
		return a*r.b >= r.a*b;
	}
};
ostream& operator << (ostream& os,const Ratio& r){os << r.a<<'/'<<r.b;return os;}

template <typename T,typename Func> T satisfy_mini(Func P,T l ,T r){//(l |sep| r)
	l -= EPS<T>();
	while(r-l>EPS<T>()){
		T m=(l+r)/2;
		(P(m)?r:l)=m;
	}
	return r;
}

class Main{
	public:
	void run(){
		// 3辺とって 一点で交わってない iff 正三角形

		int N;cin >> N;
		vector<vector<pair<ll,ll>>> es(3);
		for(int p:range(3))es[p].push_back({1,1});
		for(int i:range(N)){
			int p; ll a,b;cin >> p >> a >> b;
			es[p].push_back({a/gcd(a,a+b),(a+b)/gcd(a,a+b)});
		}

		set<Ratio> pset;
		vector<Ratio> ps;
		for(int i2:range(es[2].size())){
			ps.push_back(Ratio(es[2][i2].first,es[2][i2].second));
			pset.insert(Ratio(es[2][i2].first,es[2][i2].second));
		}
		sort(ALL(ps));

		ll res = 0;
		for(int i0:range(es[0].size()))for(int i1:range(es[1].size())){
			ll u = ((es[0][i0].second - es[0][i0].first)*es[1][i1].second+(es[1][i1].second - es[1][i1].first)*es[0][i0].second);
			ll d = es[0][i0].second*es[1][i1].second;
			if(u > d) continue;// 交点が外

			Ratio lv = max(
			Ratio(es[0][i0].second - es[0][i0].first,es[0][i0].second),
			Ratio(es[1][i1].second - es[1][i1].first,es[1][i1].second));
			int mi = satisfy_mini([&](int i){
				return lv <= ps[i];
			},0,(int)ps.size());
			// cerr << lv <<" " << ps[0] << endl;
			// cerr << es[2].size() << " " <<u <<" " << d <<" "<< mi << endl;
			// cerr <<ps.size() <<" " <<  pset.count(Ratio(u,d)) << endl;
			res += (ps.size() - mi) - pset.count(Ratio(u,d));
		}
		cout << res << endl;
	}
};

int main(){
	cout <<fixed<<setprecision(10);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}