#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<cstring>
#include<string>
#include<cstdlib>
using namespace std;
long long ans=0;
struct str{
	int ai,bi,ci;
}a[100010];
int n;
long long fun(int cur,int a1,int b1,int c1){
	if(cur==n+1){
		
		return a1+b1+c1;
	}
	int a2=max(a1,a[cur].ai);
	int b2=max(b1,a[cur].bi);
	int c2=max(c1,a[cur].ci);
	long long an=fun(cur+1,a2,b1,c1);
	an=min(an,fun(cur+1,a1,b2,c1));
	an=min(an,fun(cur+1,a1,b1,c2));
	return an;
}
int main()
{
	freopen("playwithboss.in","r",stdin);
	freopen("playwithboss.out","w",stdout);
	cin>>n;
	long long an=900000000000;
for(int i=1;i<=n;i++)
{
	cin>>a[i].ai>>a[i].bi>>a[i].ci;
}
if(n==1){
	int an1=100000000;
	an1=min(an1,a[1].ai);
	an1=min(an1,a[1].bi);
	an1=min(an1,a[1].ci);
	cout<<an1;
	return 0;
}
	
	an=min(an,fun(2,a[1].ai,0,0));
	an=min(an,fun(2,0,a[1].bi,0));
	an=min(an,fun(2,0,0,a[1].ci));
 
	cout<<an;
	return 0;
}