#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
	int n;
	cin>>n;
	vip in;
	rep(i,n){
		int a,b,c;cin>>a>>b>>c;
		in.pb(pip(a,pii(b,c)));
		in.pb(pip(a,pii(c,b)));
		in.pb(pip(b,pii(a,c)));
		in.pb(pip(b,pii(c,a)));
		in.pb(pip(c,pii(a,b)));
		in.pb(pip(c,pii(b,a)));
	}
	sort(all(in));
//	rep(i,in.size())cout<<in[i].first<<" "<<in[i].second.first<<" "<<in[i].second.second<<endl;
	vi dp(in.size()+1,1);
	rep(i,in.size())rep(j,i){
		if(in[j].first<in[i].first&&in[j].second.first<in[i].second.first&&in[j].second.second<in[i].second.second)
			dp[i]=max(dp[i],dp[j]+1);
	}
	int out=1;
	rep(i,in.size()+1)out=max(out,dp[i]);
	cout<<out<<endl;
}