#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<map>
#include<algorithm>
#include<stack>
#include<vector>
using namespace std;
long long w[100005][4];
long long n,ans,maxx[4],minn=10000000000,p;
int main()
{
	freopen("playwithboss.in","r",stdin);
	freopen("playwithboss.out","w",stdout);
	cin>>n;
	memset(maxx,0,sizeof(maxx));
	for(int i=1;i<=n;i++)
	   cin>>w[i][1]>>w[i][2]>>w[i][3];
	for(int i=1;i<=n;i++)
	{
		if(w[i][1]<=maxx[1]||w[i][2]<=maxx[2])
		  continue;
		else
		{
			if(w[i][1]>w[i][2])
			  maxx[2]=w[i][2];
			else maxx[1]=w[i][1];
		}
	}
	cout<<maxx[1]+maxx[2];
}