#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n;
    cin >> n;
    vector<array<int, 3>> v(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < 3; ++j) {
            scanf("%d", &v[i][j]);
        }
        sort(v[i].begin(),v[i].end());
    }
    sort(v.begin(),v.end());
    vector<int> dp(n,1);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            if(v[j][0] < v[i][0] && v[j][1] < v[i][1] && v[j][2] < v[i][2]){
                dp[i] = max(dp[i], dp[j]+1);
            }
        }
    }
    cout << *max_element(dp.begin(),dp.end()) << "\n";
    return 0;
}