#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#include<cmath>
using namespace std;
int n;
struct nn
{
	long long ad,ap,sp;
}m[120000];
long long sum=0,as=0,minn=1000000000;
int a[120000];
long long l=0,r=1000000000;
bool flag=0;
void init()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d",&m[i].ad,&m[i].ap,&m[i].sp);
		as+=m[i].ad;
		as+=m[i].ap;
		as+=m[i].sp;
		if(m[i].sp==100000000)flag=1;
	}
}
long long check()
{
	long long A=0,B=0,C=0;
	for(int i=1;i<=n;i++)
	{
		if(a[i]==1)A=max(m[i].ad,A);
		if(a[i]==2)B=max(m[i].ap,B);
		if(a[i]==3)C=max(m[i].sp,C);
	}
	return (A+B+C);
}
void dfs(int x)
{
	if(x==n+1)
	{
		minn=min(minn,check());
		return ;
	}
	a[x]=1;
	dfs(x+1);
	a[x]=2;
	dfs(x+1);
	a[x]=3;
	dfs(x+1);
}
void dfs2(int x)
{
	if(x==n+1)
	{
		minn=min(minn,check());
		return ;
	}
	a[x]=1;
	dfs(x+1);
	a[x]=2;
	dfs(x+1);
}
int main()
{
	freopen("playwithboss.in","r",stdin);
	freopen("playwithboss.out","w",stdout);
	memset(a,0,sizeof(0));
	init();
	if(flag)dfs2(1);
	else dfs(1);
	cout<<minn<<endl;
	return 0;
}