#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000


int main(){
	
	int N;
	cin>>N;
	
	vector<pair<pair<int,int>,int>> V(N*3); 
	
	for(int i=0;i<N;i++){
		vector<int> v(3);
		cin>>v[0]>>v[1]>>v[2];
		sort(v.begin(),v.end());
		V[i*3] = make_pair(make_pair(v[0],v[1]),v[2]);
		V[i*3+1] = make_pair(make_pair(v[0],v[2]),v[1]);
		V[i*3+2] =  make_pair(make_pair(v[1],v[2]),v[0]);
	}
		
	vector<vector<int>> ind(N+1,vector<int>());
	for(int i=0;i<(1<<N);i++){
		int c = 0;
		for(int j=0;j<N;j++){
			if((i>>j)&1)c++;
		}
		ind[c].push_back(i);
	}
	
	
	vector<vector<int>> dp(1<<N,vector<int>(N*3,-Inf));
	dp[0][0] = 0;

	for(int i=0;i<N;i++){
		for(int j=0;j<ind[i].size();j++){
			int m = ind[i][j];
			for(int k=0;k<3*N;k++){
				if(dp[m][k]==-Inf)continue;
				for(int l=0;l<3*N;l++){
					int nm = m|(1<<(l/3));
					if(m==nm)continue;
					if(i!=0&&(V[k].first.first>V[l].first.first||V[k].first.second>V[l].first.second))continue;
					dp[nm][l] = max(dp[nm][l],dp[m][k] + V[l].second);
				}
			}
		}
	}
	/*
	for(int i=0;i<(1<<N);i++){
		for(int j=0;j<3*N;j++){
			cout<<dp[i][j]<<',';
		}
		cout<<endl;
	}
	*/
	int ans = 0;
	for(int i=0;i<(1<<N);i++){
		for(int j=0;j<3*N;j++){
			ans = max(ans,dp[i][j]);
		}
	}
	
	cout<<ans<<endl;
	
	return 0;
}