#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

long long gcd(long long a, long long b){ return (b==0)?a:gcd(b,a%b); }
template<class ... T> long long gcd(long long a, long long b, T ... c){ return gcd(gcd(a,b), c...);}
long long lcm(long long a, long long b){ if(a<b) swap(a,b); return (b==1)?a:a*(b/gcd(a,b)); }
template<class ... T> long long lcm(long long a, long long b, T ... c){ return lcm(lcm(a,b), c...);}

long long extgcd(long long a, long long b, long long &x, long long &y){
  long long d=a;
  if(b!=0){
    d = extgcd(b, a%b, y, x);
    y -= (a/b) * x;
  }else{
    x = 1;
    y = 0;
  }
  return d;
}

// a/b
struct frac{
  long long a;
  long long b;

  frac() : a(1),b(1){}
  frac(long long a_, long long b_){
    long long g = gcd(a_,b_);
    a = a_/g;
    b = b_/g;
  }

  bool operator < (const frac& x) const{
    //long long l = lcm(b,x.b);
    //return a * (l/b) < x.a * (l/x.b);
    return a*x.b < x.a*b;
  }
  bool operator == (const frac& x) const{
    return a == x.a && b == x.b;
  }
};

int main(){
  int n;
  cin >> n;

  vector<vector<frac>> l(3);
  l[0].push_back( frac(1,1) );
  l[1].push_back( frac(1,1) );
  l[2].push_back( frac(1,1) );
  for(auto i : range(n) ){
    int p,x,y;
    cin >> p,x,y;

    l[p].push_back( frac(x,y+x) );
  }

  sort(l[0].begin(), l[0].end());
  sort(l[1].begin(), l[1].end());
  sort(l[2].begin(), l[2].end());

  sort(l.begin(), l.end(), [](const vector<frac>& a, const vector<frac>& b){return a.size() < b.size();});

  frac one(1,1);

  long long ans = 0;
  for(int t=0; t<1; t++){

    for(auto x : l[ (0+t)%3 ]){
      frac a(x.b-x.a, x.b);
      for(auto y : l[ (1+t)%3 ]){
        frac b(y.b-y.a, y.b);
        frac c(a.a*b.b + b.a*a.b, a.b * b.b);

        if( b<a ) b = a;

        if(one < c) continue;

        int k = l[(2+t)%3].size() - ((lower_bound(l[(2+t)%3].begin(), l[(2+t)%3].end(), b)) - l[(2+t)%3].begin());
        if( binary_search(l[(2+t)%3].begin(), l[(2+t)%3].end(), c) ) k--;

        ans += k;
      }
    }

  }

  println(ans);


  return 0;
}