#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

class Ratio{
public:
  ll x,y;
  Ratio(){}
  Ratio(ll x,ll y):x(x),y(y){
    ll g = __gcd(x,y);
    x/=g; y/=g;
  }
  Ratio operator+(const Ratio &that) const {
    return Ratio(this->x*that.y + that.x*this->y, this->y*that.y);
  }
  Ratio operator-(const Ratio &that) const {
    return Ratio(this->x*that.y - that.x*this->y, this->y*that.y);
  }
  bool operator<(const Ratio &that) const {
    return (ll)this->x * that.y < (ll)this->y * that.x;
  }
  bool operator>(const Ratio &that) const {
    return (ll)this->x * that.y > (ll)this->y * that.x;
  }
};

int n;
Ratio one(1,1);
Ratio zero(0,1);
set<Ratio> yo[3];

int main(){
  scanf("%d",&n);
  REP(i,n){
    int p,a,b;
    scanf("%d%d%d",&p,&a,&b);
    yo[p].insert(Ratio(a,a+b));
  }
  REP(p,3)yo[p].insert(one);

  map<Ratio,int> rui;
  int it = 0;
  rui[Ratio(-1e9,1)] = it++;
  for(auto a:yo[0]){
    rui[a] = it++;
  }
  rui[Ratio(1e9,1)] = it++;

  ll ans = 0;
  for(auto a1:yo[1])for(auto a2:yo[2]){
    Ratio b1 = one-a1;
    Ratio b2 = one-a2;
    if(one - a2 > a1)continue;
    Ratio high = one, low = max(b1,b2);
    ll add = 0;
    auto it = rui.upper_bound(high);it--;
    add += it->second;
         it = rui.lower_bound(low); it--;
    add -= it->second;
    ans += add;
    // banned
    if(rui.count(one-(a1-b2))){
      ans --;
    }
  }
  printf("%lld\n",ans);
  return 0;
}