#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
int n;
vector<vector<int>> box;
vector<int> len(3), e[100005];
bool can(int i, int j)
{
    return box[i][0] > box[j][0]
           && box[i][1] > box[j][1] && box[i][2] > box[j][2];
}
lli memo[100005];
lli get(int cur, int par)
{
    if (memo[cur])
        return memo[cur];
    else {
        lli ans = 0;
        for (auto s : e[cur]) {
            if (s != par) {
                ans = max(ans, get(s, cur));
            }
        }
        return memo[cur] = ans + 1;
    }
}
int main()
{
    cin >> n;
    rep(i, n)
    {
        cin >> len[0] >> len[1] >> len[2];
        sort(len.begin(), len.end());
        box.push_back(len);
    }
    rep(i, n) rep(j, n)
    {
        if (i == j)
            continue;
        if (can(i, j)) {
            e[i].push_back(j);
        }
    }
    lli ans = 0;
    rep(i, n)
    {
        ans = max(get(i, -1), ans);
    }
    cout << ans << endl;
}