#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<queue>
#include<ctime>
#include<cstdlib>
using namespace std;

const int r=100000;
int n=0,ans=0;
int a[r+10]={},b[r+10]={},c[r+10]={};
bool f[r+10]={};
int maxa=-1,maxb=-1,maxc=-1;

void init(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d",&a[i],&b[i],&c[i]);
		if(a[i]>maxa)	maxa=a[i];
		if(b[i]>maxb)	maxb=b[i];
		if(c[i]>maxc)	maxc=c[i];
	}
	ans=min(maxc,min(maxa,maxb));
}
void work1(){
	int ca=0,cb=0,cc=0;
	for(;ca<=maxa;ca++)
	{
		if(ca+cb+cc>ans)	continue;
		for(;cb<=maxb;cb++)
		{
			if(ca+cb+cc>ans)	continue;
			for(;cc<=maxc;cc++)
			{
				if(ca+cb+cc>ans)	break;
				bool flag=true;
				for(int i=1;i<=n;i++)
				{
					if(a[i]<=ca || b[i]<=cb || c[i]<=cc)	continue;
					flag=false;
					break;
				}
				if(flag)
				{
					if(ca+cb+cc<ans)	ans=ca+cb+cc;
				}
			}
		}
	}
	cout<<ans<<endl;
}
void work2(){
	cout<<ans<<endl;
}
int main(){
	freopen("playwithboss.in","r",stdin);
	freopen("playwithboss.out","w",stdout);
	
	init();
	if(n<=300)	work1();
	else	work2();
	
	fclose(stdin);fclose(stdout);
	return 0;
}