#include<iostream>
#include<map>
#include<algorithm>
#include<cstdio>
using namespace std;
int i;
int N,len=0,mlen=0;
int xx,yy,zz;
int find1=0;
int ans=0;
class pos
{
public:
	int x,y,z;
	bool view;
}p[1002];
bool cmp(pos a,pos b)
{
	return a.x<b.x&&a.y<b.y&&a.z<b.z;
}
bool check(int a)
{
	if(p[a].x>xx&&p[a].y>yy&&p[a].z>zz)
		return 1;
	return 0;
}
void init()
{
	freopen("bomba.in","r",stdin);
	cin>>N;
	for(i=0;i<N;i++)
		cin>>p[i].x>>p[i].y>>p[i].z,p[i].view=0;
}
void work()
{
	while(find1!=N)
	{len=0;
	for(i=0;i<N;i++)
		if(p[i].view==0)
		{xx=p[i].x,yy=p[i].y,zz=p[i].z,p[i].view=1,find1++,len++;break;}
	for(;i<N;i++)
	{
		if(check(i)&&p[i].view==0)
		{	
			xx=p[i].x,yy=p[i].y,zz=p[i].z,p[i].view=1,find1++;
			len++;
		}
	}
	mlen=max(len,mlen),ans++;
	}
}
void out()
{
	freopen("bomba.out","w",stdout);
	cout<<mlen<<endl<<ans<<endl;
}
int main()
{
	init();
	sort(p,p+N,cmp);
	work();
	out();
	return 0;
}