#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
short n,x=1,y=1,xr[100]={0},yr[100]={0},z=0;
int g[10][10]={0},h[10][10]={0},s=1,sum=0,sum1,res=0;
using namespace std;
int dfs(int a,int b,int c,int d){
	sum+=g[a][b];
	g[a][b]=0;
	sum+=g[c][d];
	g[c][d]=0;
	if(b+1<=n){
		if(d+1<=n) dfs(a,b+1,c,d+1);
		if(c+1<=n) dfs(a,b+1,c+1,d);
	}
	if(a+1<=n){
		if(d+1<=n) dfs(a+1,b,c,d+1);
		if(c+1<=n) dfs(a+1,b,c+1,d);
	}
	if(sum>res) res=sum;
	g[c][d]=h[c][d];
	g[a][b]=h[a][b];
	sum-=g[a][b];
	g[a][b]=0;
	sum-=g[c][d];
	g[a][b]=h[a][b];
}
int main(){
	cin>>n;
	while(s!=0){
		cin>>x>>y>>s;
		g[x][y]=s;
		h[x][y]=s;
		sum1+=s;
	}
	if(sum1==0){
		cout<<"0";
		return 0;
	}
	dfs(1,1,1,1);
	cout<<res;
	return 0;
}