#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
const int N = 1010;
int n;
int main(int argc, char const *argv[])
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cin >> n;
    vector<vector<int>> a;
    for (int i = 1; i <= n; i++)
    {
        vector<int> vec(3);
        cin >> vec[0] >> vec[1] >> vec[2];
        sort(vec.begin(), vec.end());
        a.push_back(vec);
    }
    sort(a.begin(), a.end());
    vector<int> f(n, 1);
    f[0] = 1;
    for (int i = 1; i < n; i++)
        for (int j = 0; j < i; j++)
        {
            bool flag = 1;
            for (int k = 0; k < 3; k++)
                if (a[j][k] >= a[i][k])
                    flag = 0;
            if (flag)
                f[i] = max(f[i], f[j] + 1);
        }
    int ans = 0;
    for (int i = 0; i < n; i++)
        ans = max(ans, f[i]);
    cout << ans << endl;
    return 0;
}