/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <math.h>
#include <utility>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
unsigned long long MOD = 1e9 + 7;
ll INF = 1e18;
VV gragh;
V dp;
ll dfs(ll x){
    if(dp[x]!=-1)
        return dp[x];
    ll temp = 1;
    rep(i,gragh[x].size()){
        chmax(temp, dfs(gragh[x][i])+1);
    }
    return dp[x] = temp;
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    VV vec(n);
    rep(i,n){
        ll x, y, z;
        cin >> x >> y >> z;
        V temp = {x, y, z};
        sort(all(temp), greater<ll>());
        vec[i] = temp;
    }
    gragh.resize(n);
    rep(i,n){
        rep(j,n){
            if(vec[j][0]>vec[i][0]&&vec[j][1]>vec[i][1]&&vec[j][2]>vec[i][2]){
                gragh[i].push_back(j);
            }
        }
    }
/*    rep(i,n){
        rep(j,gragh[i].size()){
            cout<<gragh[i][j]<<" ";
        }
        cout<<endl;
    }*/
    dp.resize(n,-1);
    ll res = 0;
    rep(i,n){
        chmax(res, dfs(i));
    }
  //  rep(i,n)cout<<dp[i]<<" ";
    //cout<<endl;
    cout << res << endl;
}