#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
#include<cmath>
#include<stack>
#include<cstdlib>
using namespace std;
struct N{
	int a,b,c;
}p[100100];
int n;
int a1=0,b1=0,c1=0;
int bi(N m,N n)
{
	int minn1=min(min(m.a,m.b),m.c);
	int minn2=min(min(n.a,n.b),n.c);
	return minn1<minn2;
}
bool pan()
{
	for (int i=1;i<=n;i++)
	if (a1<p[i].a&&b1<p[i].b&&c1<p[i].c)
	 return false;
	return true;
}
int main()
{
	freopen("playwithboss.in","r",stdin);
	freopen("playwithboss.out","w",stdout);
	cin>>n;
	for (int i=1;i<=n;i++)
	 cin>>p[i].a>>p[i].b>>p[i].c;
	sort(p+1,p+1+n,bi);
	for (int i=1;i<=n;i++)
	{
		if (a1>=p[i].a||b1>=p[i].b||c1>=p[i].c)
		 continue;
		else 
		{
			if (p[i].a>p[i].b&&p[i].c>p[i].b)
				b1=p[i].b;
			else if (p[i].b>p[i].a&&p[i].c>p[i].a)
				a1=p[i].a;
			else if (p[i].b>p[i].c&&p[i].a>p[i].c)
			    c1=p[i].c;
		}
	}
//	int ans1=a1,ans2=b1,ans3=c1;
//	cout<<a1<<" "<<b1<<" "<<c1<<endl;
	cout<<a1+b1+c1;
	return 0; 
	fclose(stdin);
	fclose(stdout);
}