#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cassert>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <tuple>
#include <queue>
#include <stack>
#include <functional>
#include <utility>
#include <complex>
#include <bitset>
#include <numeric>
#include <random>
using namespace std;

#define REP(i,n) for(int (i)=0; (i)<(n) ;++(i))
#define REPN(i,a,n) FOR((i),(a),(a)+(n))
#define FOR(i,a,b) for(int (i)=(a); (i)<(b) ;++(i))
#define PB push_back
#define MP make_pair
#define SE second
#define FI first
#define DBG(a) cerr<<(a)<<endl;
#define dump(a) cerr<<#a <<' '<< a <<endl;
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;  typedef pair<LL, LL> PLL; typedef vector<LL> VLL;
typedef pair<int,int>PI; typedef vector<int> VI;
const LL LINF=334ll<<53; const int INF=15<<26; const LL MOD=1E9+7;

PLL add(PLL a, PLL b){
    LL den=a.SE*b.SE;
    LL num=a.FI*b.SE+a.SE*b.FI;
    LL g=__gcd(den,num);
    return MP(num/g,den/g);
}
bool comp(PLL a, PLL b){
    REP(i,5){
        b.FI-=(b.SE/a.SE)*a.FI;
        b.SE-=(b.SE/a.SE)*a.SE;
        if(b.FI<=0) return false;
        if(b.SE==0) return true;
        a.FI-=(a.SE/b.SE)*b.FI;
        a.SE-=(a.SE/b.SE)*b.SE;
        if(a.FI<=0) return true;
        if(a.SE==0) return false;
    }
    return a.FI*b.SE<a.SE*b.FI;
}
inline bool comp2(pair<PLL,PLL> a, pair<PLL,PLL> b){
    return comp(a.FI,b.FI) ;//or (a.FI==b.FI and comp(a.SE,b.SE));
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<vector<PLL>> l(3);
    vector<PLL> sum,mi;
    REP(i,n){
        LL a,b,c;
        cin >> a >>b >> c;
        LL g=__gcd(b,c);
        l[a].emplace_back(b/g,(b+c)/g);
    }
    REP(i,3)l[i].emplace_back(1,1);
    REP(i,l[0].size()){
        REP(j,l[1].size()){
            PLL t;
            //cout<<i <<j<<endl;
            if(!comp(t=add(l[0][i],l[1][j]),MP(1,1))){
                sum.emplace_back(t);
                mi.emplace_back(comp(l[0][i],l[1][j])?l[0][i]:l[1][j]);
            }
        }
    }
    sort(ALL(sum),comp);
    sort(ALL(mi),comp);
    sort(ALL(l[2]),comp);
    LL ans=(LL)sum.size()*l[2].size();
    REP(i,l[2].size()){
        LL num=l[2][i].FI,den=l[2][i].SE;
        LL point=upper_bound(ALL(sum),MP(2*den-num,den),comp)-lower_bound(ALL(sum),MP(2*den-num,den),comp);
        LL outside=lower_bound(ALL(mi),MP(den-num,den),comp)-mi.begin();
        ans-=point+outside;
    }
    cout << ans <<endl;




    return 0;
}