#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;

int main()
{
    int n;
    cin>>n;
    vector<double> v[3];
    for(int i=0; i<n; i++){
        int p; double a, b;
        cin>>p>>a>>b;
        v[p].push_back(a/(a+b));
    }
    for(int i=0; i<3; i++){
        v[i].push_back(1);
        sort(v[i].begin(), v[i].end());
    }
    ll ans=0;
    for(int i=0; i<v[0].size(); i++){
        for(int j=0; j<v[1].size(); j++){
            double x=v[0][i], y=v[1][j];
            if(x+y<1) continue;
            double z=max(1-x, 1-y);
            int k=lower_bound(v[2].begin(), v[2].end(), z)-v[2].begin();
            ans+=(int)v[2].size()-k;
            k=lower_bound(v[2].begin(), v[2].end(), 2-x-y)-v[2].begin();
            if(k<v[2].size() && x+y+v[2][k]==2) ans--;
        }
    }
    cout<<ans<<endl;
    return 0;
}