#include <bits/stdc++.h>
#include "unistd.h"
using namespace std;
#define WA cout<<"char134217728";exit(0)
#define RE throw
#define TLE sleep(1000)
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
#define show(x) cout<<#x<<" = "<<x<<endl;
#define all(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define uniq(v) sort(all(v));v.erase(unique(all(v)), v.end());
#define bit(n) (1LL<<(n))
#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))
#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))
#define dout(d) printf("%.12f\n",d)

typedef long long ll;
typedef __int128_t lll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}
template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}
lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll gcd(ll a,ll b){lll x=0,y=0;return gcd(a,b,x,y);}
ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());

const int N = 1e5;
int n;
const pll P1 = pll(1, 1);
const pll P2 = pll(2, 1);
V<pll> v[3], c, s;
function<bool (const pll&a, const pll&b)> _less = [](const pll&a, const pll&b){
  return a.fi*b.se < b.fi*a.se;
};
pll _plus(const pll&a, const pll&b){
  return pll(a.fi*b.se+b.fi*a.se, a.se*b.se);
};
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  FOR(i, 0, n){
    int p, a, b;
    cin >> p >> a >> b;
    v[p].pb(pll(a, a+b));
  }
  sort(v, v+3, [](const V<pll>&a, const V<pll>&b){return sz(a)<sz(b);});
  FOR(i, 0, 3){
    sort(all(v[i]), _less);
    v[i].pb(pll(1,1));
  }
  reverse(all(v[1]));
  for(pll p0:v[0]) for(pll p1:v[1]){
    pll p = _plus(p0, p1);
    if(p.fi < p.se) break;
    p.fi = p.se*2-p.fi;
    c.pb(p);
    p = _less(p0, p1) ? p0 : p1;
    p.fi = p.se-p.fi;
    s.pb(p);
  }
  sort(all(c), _less);
  sort(all(s), _less);
  ll ans = 0;
  for(pll p:v[2]){
    ans += distance(
        s.begin(),
        upper_bound(all(s), p, _less)
        );
    ans -= distance(
        lower_bound(all(c), p, _less),
        upper_bound(all(c), p, _less)
        );
  }
  cout << ans << endl;
}