#include<bits/stdc++.h>usingnamespace std;int dp[11][11][11][11], a[11][11], n, x, y, z;intmain(){
cin >> n;while(cin >> x >> y >> z && x && y && z)
a[x][y]= z;for(int i =1; i <= n; i++){for(int j =1; j <= n; j++){for(int k =1; k <= n; k++){for(int l =1; l <= n; l++){
dp[i][j][k][l]=max(max(max(dp[i-1][j][k-1][l], dp[i-1][j][k][l-1]), dp[i][j-1][k-1][l]), dp[i][j-1][k][l-1])+ a[i][j]+ a[k][l];if(i == k && j == l) dp[i][j][k][l]-= a[i][j];}}}}
cout << dp[n][n][n][n];}
luogu P1004 方格取数#include <bits/stdc++.h>using namespace std;int dp[11][11][11][11], a[11][11], n, x, y, z;int main(){ cin >> n; while (cin >> x >> y >> z && x && y && z) a[x][y] = z