#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define bit(n) (1LL<<(n)) #define sz(x) ((int)(x).size()) #define fst first #define snd second using ll=long long;using pii=pair; using vb=vector;using vs=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; templateT read(){T t;cin>>t;return t;} templateostream&operator<<(ostream&o,const pair&p){o<<'('< &S) { int ok = sz(S); int ng = -1; while (abs(ok - ng) > 1) { int mid = (ok + ng) / 2; bool c = ab + S[mid] > 1; // cout << "ok: " << ok << ", ng: " << ng << ", "; // cout << "check(" << mid << ") -> " << c << endl; if (c) ok = mid; else ng = mid; } return sz(S) - ok; } void Main() { int n = read(); vector> R(3); rep(i, n) { int t = read(); int a = read(); int b = read(); R[t].emplace_back(1.0 * a / (a + b)); } { int s0 = sz(R[0]); int s1 = sz(R[1]); int s2 = sz(R[2]); if (s0 > s2) swap(R[0], R[2]); if (s1 > s2) swap(R[1], R[2]); } rep(i, 3) sort(all(R[i])); ll ans = 1 + n; forr(ab, R[1]) { int c0 = bs(ab, R[0]); ans += c0; } forr(ab, R[2]) { int c0 = bs(ab, R[0]); int c1 = bs(ab, R[1]); ans += c0; ans += c1; } // R[0] と R[1] forr(ab, R[0]) { forr(cd, R[1]) { if (ab + cd >= 1) { { long double z = 1 - (ab < cd ? ab : cd); ans += R[2].end() - lower_bound(all(R[2]), z); } { auto e = (1-cd) + (1-ab); auto f = cd - (1-ab); long double ef(e / (e+f)); ans -= upper_bound(all(R[2]), ef) - lower_bound(all(R[2]), ef); } } } } cout << ans << endl; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }