#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;

    vector<vector<int64_t>> a(3), b(3);
    for (int i = 0; i < 3; i++) {
        a[i].push_back(1);
        b[i].push_back(1);
    }
    for (int i = 0; i < n; i++) {
        int p, ta, tb;
        cin >> p >> ta >> tb;
        a[p].push_back(ta);
        b[p].push_back(ta + tb);
    }
    uint32_t ans = 0;
    for (int i = 0; i < a[0].size(); i++) {
        for (int j = 0; j < a[1].size(); j++) {
            if (a[0][i] * b[1][j] + a[1][j] * b[0][i] < b[0][i] * b[1][j]) {
                continue;
            }

            int64_t minA, minB;

            // a[0][i]/b[0][i] < a[1][j]/b[1][j]
            if (a[0][i] * b[1][j] < a[1][j] * b[0][i]) {
                minA = a[0][i];
                minB = b[0][i];
            } else {
                minA = a[1][j];
                minB = b[1][j];
            }

            int64_t x = a[0][i] * b[1][j];
            int64_t y = a[1][j] * b[0][i];
            int64_t z = b[0][i] * b[1][j];
            int64_t w = b[0][i] * b[1][j];
            int64_t u = x + y - 2 * w;
            int64_t v = minA - minB;

            for (int k = 0; k < a[2].size(); k++) {
                if (v * b[2][k] + a[2][k] * minB >= 0 && u * b[2][k] + a[2][k] * z != 0) {
                    ans++;
                }
            }
        }
    }
    cout << ans << endl;
}