#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define show(x) cout << #x << " = " << x << endl;
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
    int n;
    cin >> n;
    vector<vector<int>>v;
    rep(i,n){
        vector<int>a(3);
        rep(j,3)cin >> a[j];
        sort(a.begin(),a.end());
        v.push_back(a);

    }
    sort(v.begin(),v.end());
    vector<int>dp(n,1);
    rep(i,n){
        for(int j = i+1; j < n; j++){
            bool flag = true;
            rep(k,3){
                if(v[i][k] >= v[j][k])flag = false;
            }
            if(flag){
                dp[j] = max(dp[j],dp[i] + 1);
            }
        }
    }
    cout << *max_element(dp.begin(),dp.end()) << endl;
}