#include<cstdio>
#include<vector>
#include<algorithm>


using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using ll=long long;


class box_t
{
	int x, y, z;
public:
	box_t(int x, int y, int z)
	{
		if(x>y) swap(x, y);
		if(x>z) swap(x, z);
		if(y>z) swap(y, z);
		this->x=x;
		this->y=y;
		this->z=z;
	}
	bool operator<(const box_t&rhs) const
	{
		if(x!=rhs.x) return x<rhs.x;
		if(y!=rhs.y) return y<rhs.y;
		return z<rhs.z;
	}
	bool greater(box_t& rhs)
	{
		return (x>rhs.x && y>rhs.y && z>rhs.z);
	}
	void print(void)
	{
		printf("%d %d %d\n", x, y, z);
	}
};

int solve(vector<box_t>&b)
{
	int n=b.size();
	vector<int> dp(n, 1);

	for(int i=0;i<n;i++)
	{
		for(int j=0;j<i;j++)
		{
			if(b[i].greater(b[j]))
			{
				dp[i]=max(dp[i], dp[j]+1);
			}
		}
	}

	int ret=dp[0];
	for(int i=1;i<n;i++)
	{
		ret=max(ret, dp[i]);
	}
	return ret;
}


int main(void)
{
	int n;

	while(scanf("%d", &n)==1)
	{
		vector<box_t> b;
		for(int i=0;i<n;i++)
		{
			int x, y, z;
			scanf("%d%d%d", &x, &y, &z);
			b.push_back(box_t(x, y, z));
		}
		sort(b.begin(), b.end());
		printf("%d\n", solve(b));
	}

	return 0;
}