import java.io.*; import java.util.*; public class Main_yukicoder461 { private static Scanner sc; private static Printer pr; private static void solve() { int n = sc.nextInt(); List> ab = new ArrayList<>(); for (int i = 0; i < 3; i++) { ab.add(new ArrayList<>()); } for (int i = 0; i < n; i++) { int p = sc.nextInt(); int a = sc.nextInt(); int b = sc.nextInt(); ab.get(p).add(new Pair(a, a + b)); } for (int i = 0; i < 3; i++) { ab.get(i).add(new Pair(1, 1)); Collections.sort(ab.get(i)); } long ret = 0; for (int i = 0; i < 3; i++) { ret += ab.get(i).size(); // pr.printf("%d %d\n", i, ab.get(i).size()); ret += cnt(ab.get(i), ab.get((i - 1 + 3) % 3)); // pr.printf("%d %d\n", i, cnt(ab.get(i), ab.get((i - 1 + 3) % 3))); ret += cnt(ab.get(i), ab.get((i + 1) % 3)); // pr.printf("%d %d\n", i, cnt(ab.get(i), ab.get((i + 1) % 3))); } Pair e1b = new Pair(0, 0); Pair e2b = new Pair(0, 0); for (int i = 0; i < 3; i++) { for (Pair e1 : ab.get((i + 1) % 3)) { e1b.a = e1.ab - e1.a; e1b.ab = e1.ab; if (e1b.a == 0) { continue; } for (Pair e2 : ab.get((i + 2) % 3)) { e2b.a = e2.ab - e2.a; e2b.ab = e2.ab; if (e2b.a == 0) { continue; } ret += cnt2(e1b, e2b, ab.get(i)); } } } // pr.println(ret); pr.println(ret / 3); } private static int cnt(List l1, List l2) { int ret = 0; int n = l1.size(); // Pair tmp = new Pair(0, 0); for (Pair e2 : l2) { tmp.a = e2.ab - e2.a; tmp.ab = e2.ab; if (tmp.a == 0) { continue; } int index = Collections.binarySearch(l1, tmp); if (index >= 0) { ret += n - (index + 1); } else { index = -(index + 1); ret += n - index; } } return ret; } private static Pair tmp = new Pair(0, 0); private static Pair tmpone = new Pair(1, 1); private static int cnt2(Pair e1b, Pair e2b, List l) { int ret = 0; int n = l.size(); if (n == 0) { return 0; } tmp.a = e1b.a * e2b.ab + e2b.a * e1b.ab; tmp.ab = e1b.ab * e2b.ab; if (tmp.compareTo(tmpone) > 0) { return 0; } Pair max; if (e1b.compareTo(e2b) > 0) { max = e1b; } else { max = e2b; } int index = Collections.binarySearch(l, tmp); if (index >= 0) { ret += n - (index + 1); } else { index = -(index + 1); ret += n - index; } int index2 = Collections.binarySearch(l, max); if (index2 >= 0) { ret += index - index2; } else { index2 = -(index2 + 1); ret += index - index2; } // if (tmp.compareTo(tmpone) < 0) { // ret++; // } return ret; } private static class Pair implements Comparable { long a; long ab; Pair(long a, long ab) { this.a = a; this.ab = ab; } @Override public int compareTo(Pair o) { // return Long.compare(a * (o.a + o.b), o.a * (a + b)); return Long.compare(a * o.ab, o.a * ab); } } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }