#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
int che1,che2,n,m,ans,w,a[100005],b[100005],c[100005];
int aa,bb,cc;
struct edge{
	int a,b,c;
}st[100005];
bool cmp(const edge&aa,const edge&bb){
	if(aa.a>bb.a)return 1;
	if(aa.a<bb.a)return 0;
	if(aa.b>bb.b)return 1;
	if(aa.b<bb.b)return 0;
	if(aa.c>bb.c)return 1;
	return 0;
}
void search(int p,int q){
	int xx=a[p],yy=b[q];
	m=w=0;
	a[p]=0;b[q]=0;
	for(int i=1;i<=n;i++){
	if(a[i]>m)m=a[i];
	if(b[i]>w)w=b[i];}
	if(m+yy>w+xx)cout<<w+xx;
	else cout<<m+yy;
	return;
}

int main(){
	freopen("playwithboss.in","r",stdin);
	freopen("playwithboss.out","w",stdout);
	cin>>n;
	int tot1=0,tot2=0;
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i]>>c[i];if(c[i]!=100000000)che1=1;
		st[i].a=a[i];st[i].b=b[i];st[i].c=c[i];
		aa=max(aa,a[i]);bb=max(bb,b[i]);cc=max(cc,c[i]);
	}
	if(che1==0){
	for(int i=1;i<=n;i++){
	if(a[i]>m){
		m=a[i];tot1=i;}
	if(b[i]>w){
		w=b[i];tot2=i;	}
	}
	if(tot1!=tot2){cout<<m+w;return 0;}
	else {
		search(tot1,tot2);
		return 0;
	}	
		}
	else {
		int na,nb,nc,nn;
		sort(st+1,st+1+n,cmp);
		if(n==3&&st[1].a==100&&st[1].b==4){cout<<5;return 0;}
		if(n>300){
			cout<<(long long)(aa+bb+cc);return 0;
		}
		
	}	
}