#include<bits/stdc++.h>
using namespace std;
int lei,sum,n;
int x,y,m;
int dx[]={0,1};
int dy[]={1,0};
int f[20][20];
int search(int x,int y){
if(x==2*n&&y==2*n){
return sum;
}
if(x==n&&y==n) {
return search(x+1,y+1) ;
}
for(int i=0;i<2;i++){
int newx=x+dx[i];
int newy=y+dy[i];
if(newx<=n&&newy<=n){A
lei=search(newx,newy)+lei;
f[x+n][y+n]=0;
if(lei>sum) sum=lei;
}
else if(newx>n&&newy>n&&newx<=2*n&&newy<=2*n){
lei=search(newx,newy)+lei;
if(lei>sum) sum=lei;
}
}
return f[x][y];
}
int main(){
cin>>n;
for(int i=1;i<=9;i++){
cin>>x>>y>>m;
if(x==0&&y==0&&m==0) break;
f[x][y]=m;
f[x+n][y+n]=m;
}
cout<<search(1,1);
return 0;
}