#include<iostream>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<vector>
#include<stack>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
using namespace std;
int n;
struct boss
{
	int a,b,c;
};
boss m[100001];
vector<boss> A;
vector<boss> B;
vector<boss> C;
void read()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>m[i].a>>m[i].b>>m[i].c;
		if(m[i].a<m[i].b&&m[i].a<m[i].c) A.push_back(m[i]);
		if(m[i].b<m[i].a&&m[i].b<m[i].c) B.push_back(m[i]);
		if(m[i].c<m[i].b&&m[i].c<m[i].a) C.push_back(m[i]);
	}	
}
void sovle()
{
	int maxa=0,maxb=0,maxc=0;
	for(int i=0;i<A.size();i++)
		if(maxa<A[i].a) maxa=A[i].a;
	for(int i=0;i<B.size();i++)
		if(maxb<B[i].b) maxb=B[i].b;
	for(int i=0;i<C.size();i++)
		if(maxc<C[i].c) maxc=C[i].c;
	cout<<maxa+maxb+maxc<<endl;	
}
int main()
{
	freopen("playwithboss.in","r",stdin);
	freopen("playwithboss.out","w",stdout);
	read();
	sovle();
	return 0;
}