#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<ctime>
#include<cstdlib>
#include<string>
#include<cmath>
using namespace std;
inline int read()
{
	int x=0;char ch=getchar();
	while(ch<'0'&&ch>'9'){ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x;
}
int N;
struct boss
{
	int a,b,c;
}B[100010];
inline bool mycmp(const boss &A,const boss &B)
{return A.a<B.a;}
void workQAQ()
{
	int maxxa=0,maxxb=0,maxxc=0;
	for(int i=1;i<=N;i++)
	{
		maxxa=max(maxxa,B[i].a);
		maxxb=max(maxxb,B[i].b);
		maxxc=max(maxxc,B[i].c);
	}
	printf("%d\n",min(maxxa,min(maxxb,maxxc)));
}
void work30()
{
	int ans=1<<30,maxx;
	for(int i=0;i<=300;i++)
		for(int j=0;j<=300;j++)
		{
			maxx=0;
			for(int k=1;k<=N;k++)
				if(i<B[k].a&&j<B[k].b)
					maxx=max(maxx,B[k].c);
			ans=min(ans,maxx+i+j);
		}
	printf("%d\n",ans);
}
int get_sum(int x)
{
	int maxx=0;
	for(int i=1;i<=N;i++)
		if(B[i].a>x)
			maxx=max(maxx,B[i].b);
	return x+maxx;
}
void work40()
{
	sort(B+1,B+1+N,mycmp);
	int L=0,R=100000,M,t1,t2;
	while(L+1!=R)
	{
		M=(L+R)>>1;
		t1=get_sum(M),t2=get_sum(M+1);
		if(t1==t2)
		{
			printf("%d\n",t1);
			return;
		}
		if(t1>t2)
			L=M;
		else
			R=M;
	}
	printf("%d\n",min(get_sum(L),get_sum(R)));
}
int main()
{
	freopen("playwithboss.in","r",stdin);
	freopen("playwithboss.out","w",stdout);
	N=read();
	for(int i=1;i<=N;i++)
		B[i].a=read(),B[i].b=read(),B[i].c=read();
	bool is40=1;
	for(int i=1;i<=N;i++)
		if(B[i].c!=100000000)
		{
			is40=0;
			break;
		}
	if(is40)
		work40();
	else if(N<=500)
		work30();
	else
		workQAQ();
	fclose(stdin),fclose(stdout);
	return 0;
}