using System;
using System.Collections.Generic;
using System.Linq;
using System.Linq.Expressions;
using System.IO;

class Program
{
    static StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
    static Scan sc = new Scan();
    static void Main()
    {
        int n = sc.Int;
        var lines = new List<long[]>[3];
        for (int i = 0; i < 3; i++)
        {
            lines[i] = new List<long[]>();
            lines[i].Add(new long[]{ 0, 1 });
        }
        for (int i = 0; i < n; i++)
        {
            var a = sc.IntArr;
            var g = mymath.gcd(a[1], a[2]);
            lines[a[0]].Add(new long[]{ a[2] / g, (a[1] + a[2]) / g });
        }
        for (int i = 0; i < 3; i++)
            lines[i].Sort((x, y) => (x[0] * y[1]).CompareTo(y[0] * x[1]));

        long ans = 0;
        foreach (var a in lines[0])
        {
            foreach (var b in lines[1])
            {
                if (!okay(a, b)) continue;

                long s = a[0] * b[1] + a[1] * b[0], t = a[1] * b[1];
                var g = mymath.gcd(s, t);
                s /= g;
                t /= g;
                int ok = 0, ng = lines[2].Count;
                while (ok < ng - 1)
                {
                    int m = (ok + ng) >> 1;
                    var c = lines[2][m];
                    if (okay(a, c) && okay(b, c))
                        ok = m;
                    else
                        ng = m;
                }
                ans += ok + 1;
                long u = t - s;
                int l = 0, r = lines[2].Count - 1;
                while (true)
                {
                    int m = (l + r) >> 1;
                    var c = lines[2][m];
                    if (t * c[0] == u * c[1])
                    {
                        --ans;
                        break;
                    }
                    if (l == r) break;

                    if (t * c[0] < u * c[1])
                        l = m + 1;
                    else
                        r = m - 1;
                }
            }
        }
        sw.WriteLine(ans);
        sw.Flush();
    }
    static bool okay(long[] a, long[] b) => a[0] * b[1] + a[1] * b[0] <= a[1] * b[1];
}
class Scan
{
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => Console.ReadLine().Trim();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split();
}
class mymath
{
    public static long gcd(long a, long b)
    {
        while (b > 0) { var t = a % b; a = b; b = t; }
        return a;
    }
    // a x + b y = gcd(a, b)
    public static long extgcd(long a, long b, out long x, out long y)
    {
        long g = a; x = 1; y = 0;
        if (b > 0) { g = extgcd(b, a % b, out y, out x); y -= a / b * x; }
        return g;
    }
    public static long lcm(long a, long b) => a / gcd(a, b) * b;
}