#include<bits/stdc++.h>
using namespace std;
const int N=11;
int m[N][N];
int dp[2*N][N][N];
int main()
{
int n;
cin>>n;
int a,b,c;
while(cin>>a>>b>>c && (a||b||c))
{
m[a][b]=c;
}
for(int k=2;k<=2*n;k++)
{
for(int i1=1;i1<=n;i1++)
{
for(int i2=1;i2<=n;i2++)
{
int j1=k-i1,j2=k-i2;
if(j1>=1&&j1<=n&&j2>=1&&j2<=n)
{
int &x=dp[k][i1][i2];
int v=m[i1][j1];
if(i1!=i2) v+=m[i2][j2];
x=max(x,dp[k-1][i1-1][i2-1]+v);
x=max(x,dp[k-1][i1-1][i2]+v);
x=max(x,dp[k-1][i1][i2]+v);
x=max(x,dp[k-1][i1][i2-1]+v);
}
}
}
}
cout<<dp[2*n][n][n];
return 0;
}