using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		
		List<Q> Bottom = new List<Q>();
		List<Q> L = new List<Q>();
		List<Q> R = new List<Q>();
		Bottom.Add(new Q(0,1+0));
		L.Add(new Q(1,1+0));
		R.Add(new Q(1,1+0));
		
		
		for(int i=0;i<N;i++){
			if(P[i] == 0){
				Bottom.Add(new Q(B[i],(A[i]+B[i])));
			}else if(P[i] == 1){
				L.Add(new Q(A[i],B[i]+A[i]));
			}else{
				R.Add(new Q(A[i],B[i]+A[i]));
			}
		}
		Bottom.Sort();
		//Console.WriteLine(String.Join(" ",Bottom));
		long ans = 0;
		foreach(var le in L){
			foreach(var re in R){
				var h = le - (1 - re);
				if(h < 0) continue;
				var uh = Q.Min(le,re);
				
				int l = 0;
				int r = Bottom.Count;
				int c = 0;
				while(r-l>1){
					c = (r+l)/2;
					if(Bottom[c] < uh){
						l = c;
					}else{
						r = c;
					}
				}
				//Console.WriteLine("le:{0},re:{1},l;{2}",le,re,l);
				ans += l+1;
			}
		}
		
		Console.WriteLine(ans);
		
		
	}
	
	
	
	
	int N;
	long[] P,A,B;
	public Sol(){
		N = ri();
		P = new long[N];
		A = new long[N];
		B = new long[N];
		for(int i=0;i<N;i++){
			var d = rla();
			P[i] = d[0];
			A[i] = d[1];
			B[i] = d[2];
		}
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}

struct Q:IComparable<Q> {
	long num;
	long den;
	public static long gcd(long a,long b){
		return a==0?b:gcd(b%a,a);
	}
	public static Q Red(Q x){
		long n=x.Num;
		long d=x.Den;
		long g=gcd(Math.Abs(n),Math.Abs(d));
		n/=g;
		d/=g;
		if(d<0){n*=-1;d*=-1;}
		return new Q(n,d);
	}
	
	public int CompareTo(Q t){
		var d = num*t.den-den*t.num;
		return d > 0 ? 1 : d < 0 ? -1 : 0;
	}
	
	public long Num{
		get{return num;}
		set{this.num=value;}
	}
	public long Den{
		get{return den;}
		set{this.den=value;}
	}
	
	public Q(long n_,long d_){
		num=n_;den=d_;
	}
	
	public static implicit operator Q(long n){
		return new Q(n,1);
	}
	public static Q operator+(Q a,Q b){
		 return Red(new Q(a.Num*b.Den+a.Den*b.Num,a.Den*b.Den));
	}
	public static Q operator-(Q a,Q b){
		 return Red(new Q(a.Num*b.Den-a.Den*b.Num,a.Den*b.Den));
	}
	public static Q operator-(Q a){
		 return Red(new Q(-a.Num,a.Den));
	}
	public static Q operator*(Q a,Q b){
		 return Red(new Q(a.Num*b.Num,a.Den*b.Den));
	}
	public static Q operator/(Q a,Q b){
		 return Red(new Q(a.Num*b.Den,a.Den*b.Num));
	}
	public static bool operator>(Q a,Q b){
		 return a.CompareTo(b) > 0;
	}
	public static bool operator<(Q a,Q b){
		 return a.CompareTo(b) < 0;
	}
	public static bool operator>=(Q a,Q b){
		 return a.CompareTo(b) >= 0;
	}
	public static bool operator<=(Q a,Q b){
		 return a.CompareTo(b) <= 0;
	}
	public static Q Min(Q a,Q b){
		 return a < b ? a : b;
	}
	public override String ToString(){
		return this.Num.ToString()+"/"+this.Den.ToString();
	}
}