#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int map[10][10];
int book[10][10];
int max1[105];
int v=1;
int x,y,value,sum;
bool check=1;
void dfs(int i,int j)
{
	book[i][j]=1;
	if(book[i+1][j]==0&&i+1<=9)
	{
		max1[v]+=map[i+1][j];
		dfs(i+1,j);
		book[i+1][j]=0;
	}
	if(book[i][j+1]==0&&j+1<=9)
	{
		max1[v]+=map[i][j+1];
		dfs(i,j+1);
		book[i][j+1]=0;
	}
	if(i==j==9)
	{
		v++;
		return;
	}
}
int main()
{
	do
	{
		scanf("%d%d%d",&x,&y,&value);
		if(x!=0&&y!=0&&value!=0)
			break; 
		map[x][y]=value;
	}
	while(check=1);
	dfs(0,0);
	sort(max1[1],max1[v]);
	int maxf=max1[v]+max1[v-1];
	printf("%d",maxf);
	return 0;
}