#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define FORR(x, arr) for(auto& x:arr)
#define ITR(x, c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
typedef pair<int, int> P;

int n, dp[1005];

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> n;
	vector<pair<int, P> > v(n);
	FOR(i, n) {
		vector<int> a(3);
		FOR(j, 3) cin >> a[j];
		sort(ALL(a));
		v[i] = {a[0], {a[1], a[2]}};
	}
	sort(ALL(v));
	fill(dp, dp+n, 1);
	FOR(i, n) {
		int a = v[i].first, b = v[i].second.first, c = v[i].second.second;
		for (int j = i-1; j >= 0; j--) {
			int _a = v[j].first, _b = v[j].second.first, _c = v[j].second.second;
			if (_a < a && _b < b && _c < c) {
				dp[i] = max(dp[i], dp[j]+1);
			}
		}
		// int x = lower_bound(ALL(v), pair<int, P>({a-1, {0, 0}})) - v.begin();
		// int y = lower_bound(ALL(v), pair<int, P>({0, {b-1, 0}})) - v.begin();
		// int z = lower_bound(ALL(v), pair<int, P>({0, {0, c-1}})) - v.begin();
		// int pos = min({x, y, z});
		// dp[i] = dp[pos]+1;
		// cout << a << " " << b << " " << c << " " << dp[i] << endl;
	}
	cout << dp[n-1] << endl;
	return 0;
}