#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <set>
#include <queue>
#include <numeric>

using namespace std;
using PII = pair<int, int>;

bool is_bigger(vector<int> a, vector<int> b) {
	do {
		if (a[0] > b[0] && a[1] > b[1] && a[2] > b[2]) {
			return true;
		}
	} while (next_permutation(b.begin(), b.end()));

	return false;
}

int main() {
	int n, x, y, z;
	cin >> n;

	vector<vector<int>> cubes(n);
	for (int i = 0; i < n; i++) {
		cin >> x >> y >> z;
		cubes[i] = {x, y, z};
		sort(cubes[i].begin(), cubes[i].end());
	}

	vector<set<int>> connect(n);

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (i != j && is_bigger(cubes[i], cubes[j])) {
				connect[i].insert(j);
			}
		}
	}

	priority_queue<PII, vector<PII>, greater<PII>> que;
	for (int i = 0; i < n; i++) {
		que.push(make_pair(connect[i].size(), i));
	}


	vector<int> memo(n, 0);
	while (!que.empty()) {
		auto p = que.top();
		que.pop();
		int x = p.second;
		int maxi = memo[x];
		for (auto e : connect[x]) {
			maxi = max(maxi, memo[e]);
		}
		memo[x] = maxi + 1;
	}

	cout << *max_element(memo.begin(), memo.end()) << endl;
	return 0;
}