#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
int N;
class Point
{
public:
	int x,y,z;
}p[1010];
int f[1010];
bool cmp(Point a,Point b)
{
	if(a.x!=b.x)return a.x<b.x;
	if(a.y!=b.y)return a.y<b.y;
	return a.z<b.z;
}
bool vis[1010]={0};
int match[1010]={0};
bool find(int u)
{
	vis[u]=true;
	for(int v=1;v<=N;v++)
		if(f[v]-f[u]==1)
		{
			if(vis[v])continue;
			vis[v]=true;
			if(match[v]==0 || find(match[v]))
			{
				match[v]=u;
				match[u]=v;
				return true;
			}
		}
	return false;	
}
int main()
{
	freopen("bomba.in","r",stdin);
	freopen("bomba.out","w",stdout);
	scanf("%d",&N);
	for(int i=1;i<=N;i++)
		scanf("%d%d%d",&p[i].x,&p[i].y,&p[i].z);
	sort(p+1,p+N+1,cmp);
	f[N]=1;
	for(int i=N-1;i>=1;i--)
	{
		f[i]=1;
		for(int j=i+1;j<=N;j++)
			if(p[i].x<p[j].x && p[i].y<p[j].y && p[i].z<p[j].z)
				f[i]=max(f[i],f[j]+1);
	}
	int Ans=0;
	for(int i=1;i<=N;i++)
		Ans=max(Ans,f[i]);
	printf("%d\n",Ans);
	int Ans_2=N;
	for(int i=1;i<=N;i++)
	{
		memset(vis,false,sizeof(vis));
		Ans_2-=find(i);
	}
	printf("%d\n",Ans_2);
	return 0;
}