using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var n = NN; var map = NArr(n); var tree = new List[n]; for (var i = 0; i < n; ++i) tree[i] = new List(); var refs = new int[n]; for (var i = 0; i < n; ++i) for (var j = 0; j < n; ++j) if (i != j && IsSmall(map[i], map[j])) { tree[i].Add(j); ++refs[j]; } var q = new Queue(); var len = new int[n]; for (var i = 0; i < n; ++i) if (refs[i] == 0) { q.Enqueue(i); len[i] = 1; } while (q.Count > 0) { var cur = q.Dequeue(); foreach (var next in tree[cur]) { len[next] = Math.Max(len[next], len[cur] + 1); --refs[next]; if (refs[next] == 0) q.Enqueue(next); } } WriteLine(len.Max()); } static bool IsSmall(int[] a, int[] b) { if (a[0] < b[0] && a[1] < b[1] && a[2] < b[2]) return true; if (a[0] < b[0] && a[2] < b[1] && a[1] < b[2]) return true; if (a[1] < b[0] && a[0] < b[1] && a[2] < b[2]) return true; if (a[1] < b[0] && a[2] < b[1] && a[0] < b[2]) return true; if (a[2] < b[0] && a[0] < b[1] && a[1] < b[2]) return true; if (a[2] < b[0] && a[1] < b[1] && a[0] < b[2]) return true; return false; } }