#include<bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3")


#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,0,-1,1,1,-1,-1,0};
const ll dx[9]={1,0,-1,0,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
/*pl add(pl a,pl b){
  ll f=a.first*b.second+a.second*b.first,g=a.second*b.second;
  ll k=gcd(f,g);
  return make_pair(f/k,g/k);
}*/
int main(){
  ll n;cin >> n;
  vvpl lin(3);
  rep(i,n){
    ll k,a,b;cin >> k >> a >> b;
    lin[k].emplace_back(make_pair(a,a+b));
  }
  rep(i,3)lin[i].emplace_back(make_pair(1,1));
  rep(i,3){
    sort(all(lin[i]),[](pl a,pl b){return a.first*b.second<a.second*b.first;});
  }
  rev(all(lin[2]));
  ll ans=0;
  for(auto p:lin[0]){
    for(auto q:lin[1]){
      if(p.first*q.second+q.first*p.second<p.second*q.second)continue;
      for(auto r:lin[2]){
        //cout << p.first <<" " << p.second <<" " << q.first <<" " <<q.second <<" " << r.first <<" " << r.second << endl;
        if(max(q.second*r.second*(p.second-p.first),p.second*r.second*(q.second-q.first))<=p.second*q.second*r.first){
          ans++;
        }
        else break;
        if(p.second*q.second*r.second*2-p.first*q.second*r.second-q.first*p.second*r.second==r.first*p.second*q.second)ans--;
        //cout << ans << endl;
      }
    }
  }
  cout << ans << endl;
}