#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import itertools
from fractions import Fraction
from bisect import bisect_left, bisect_right

N = int(readline())
X = [[Fraction(0, 1)] for _ in range(3)]
m = map(int, read().split())
for p, a, b in zip(m, m, m):
    X[p].append(Fraction(b, a + b))

X.sort(key=len)
X[0].sort()
X[1].sort()
X[2].sort()


def solve(X, Y, Z):
    ret = 0
    for x, y in itertools.product(X, Y):
        if x + y > 1:
            continue
        cnt = bisect_right(Z, 1 - max(x, y))
        z = 1 - x - y
        cnt -= bisect_right(Z, z) - bisect_left(Z, z)
        ret += cnt
    return ret


print(solve(*X))