#include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<29;
const ll INF=1ll<<52;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,-0};
const int DX[8]={-1,-1,-1,0,1,1,1,0},DY[8]={1,0,-1,-1,-1,0,1,1};

int n;
vvi a;

int main(){
	cin>>n;
	a=vvi(n,vi(3));
	for(int i=0;i<n;i++){
		for(int j=0;j<3;j++) cin>>a[i][j];
		sort(a[i].begin(),a[i].end());
	}
	sort(a.begin(),a.end());
	vi dp(n,1);
	int res=1;
	for(int i=0;i<n;i++){
		for(int j=0;j<i;j++) if(a[j][0]!=a[i][0]&&a[j][1]<a[i][1]&&a[j][2]<a[i][2]) dp[i]=max(dp[i],dp[j]+1);
		res=max(res,dp[i]);
	}
	cout<<res<<endl;
}