#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

struct box {
    ll X;
    ll Y;
    ll Z;
    int num;
};

bool asc(const box& left, const box& right) {
    if (left.X != right.X) return left.X < right.X;
    else if (left.Y != right.Y) return left.Y < right.Y;
    else if (left.Z != right.Z) return left.Z < right.Z;
    else return true;
}

bool con(box cld, box prnt) {
    return cld.X < prnt.X && cld.Y < prnt.Y && cld.Z < prnt.Z;
}

int main(void) {
    int ans = 1;
    ll N;
    vector<ll> len(3);
    vector<box> bxs;
    cin >> N;
    for (int i=0; i<N; i++) {
        cin >> len[0] >> len[1] >> len[2];
        sort(len.begin(), len.end());
        bxs.push_back({len[0],len[1],len[2],1});
    }
    sort(bxs.begin(), bxs.end(), asc);
    for (int i=0; i<N; i++) {
        for (int j=i+1; j<N; j++) {
            if(con(bxs[i], bxs[j])) bxs[j].num++;
            ans = max(ans, bxs[j].num);
        }
    }
    cout << ans << endl;
    return 0;
}