#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdlib>

template <typename T>
T gcd(T x, T y) {
    T z; while (x) { z = x; x = y % x; y = z; } return y;
}

template <typename T>
struct rational {
    T a, b;
    rational():a(0),b(1) {}
    rational(T _a):a(_a),b(1) {}
    rational(T _a, T _b):a(_a),b(_b) {}
    rational<T> operator +(const rational<T> o) const { 
        return b == o.b ? rational<T>(a + o.a, b) : rational<T>(a * o.b + o.a * b, b * o.b);
    }
    rational<T> operator -(const rational<T> o) const {
        return b == o.b ? rational<T>(a - o.a, b) : rational<T>(a * o.b - o.a * b, b * o.b);
    }
    bool operator <(const rational<T> o) const {
        return b == o.b ? a < o.a : a * o.b < o.a * b;
    }
    rational<T> diff1() const { return rational<T>(b - a, b); }
};

int sfun(const void* p, const void* q) {
    return ((std::vector<rational<long long> >*)p)->size() - ((std::vector<rational<long long> >*)q)->size();
}

int main() {
    
    using std::vector;
    typedef rational<long long> rational;
    
    int n;
    vector<rational> ps[3];
    
    std::cin >> n;
    for (auto i = 0; i < n; i++) {
        int p, a, b;
        std::cin >> p >> a >> b;
        int g = gcd(a, a + b);
        ps[p].push_back({a / g, (a + b) / g});
    }
    
    for (auto i = 0; i < 3; i++) {
        ps[i].push_back({1, 1});
        std::sort(ps[i].begin(), ps[i].end());
    }
    
    qsort(ps, sizeof(ps)/sizeof(ps[0]), sizeof(ps[0]), sfun);
    
    auto &p0 = ps[0], &p1 = ps[1], &p2 = ps[2];
    auto ans = 0;
    
    for (auto it0 = p0.begin(); it0 != p0.end(); it0++) {
        auto x = *it0, dx = x.diff1();
        for (auto it1 = std::lower_bound(p1.begin(), p1.end(), dx); it1 != p1.end(); it1++) {
            auto y = *it1, dy = y.diff1();
            auto it2 = std::lower_bound(p2.begin(), p2.end(), std::min(x, y).diff1());
            ans += (p2.end() - it2) - 1;
            if ((x - dy).a) {
                auto r = dx + dy;
                auto cr = std::lower_bound(it2, p2.end(), r);
                if ((r - *cr).a) {
                    ans++;
                }
            }
        }
    }
    
    std::cout << ans << std::endl;
    
    
    return 0;
}