#include <fstream>
#include <algorithm>
#define N 100010
using namespace std;
ifstream in("playwithboss.in");
ofstream out("playwithboss.out");
int n;
int ans=0,INF=(1<<29);
class node
{
public:
	int x,y,z;
}e[N];
bool check(int X,int Y,int Z)
{
	int i;
	for(i=1;i<=n;i++)
	{
		if(e[i].x>X&&e[i].y>Y&&e[i].z>Z)
		{
			return 0;
		}
	}
	return 1;
}
void read()
{
	int i,j,k;
	int l;
	in>>n;
	ans=INF;
	l=max(n,300);
	for(i=1;i<=n;i++)in>>e[i].x>>e[i].y>>e[i].z;
	for(i=0;i<=l;i++)
	{
		if(i>=ans)continue;
		for(j=0;j<=l;j++)
		{
			if(i+j>=ans)continue;
			for(k=0;k<=l;k++)
			{
				if(i+j+k>=ans)continue;
				if(check(i,j,k))
				{
					if(ans>(i+j+k))ans=i+j+k;
				}
			}
		}
	}
	out<<ans<<endl;
}
int main()
{
	read();
	//work();
	return 0;
}