#include <bits/stdc++.h>
using namespace std;

#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int memo[50][(1 << 16)];

typedef pair<pair<int, int>, pair<int, int>> P;
vector<P> vec;

int dp(int i, int bit){
	bit |= vec[i].second.second;
	if(memo[i][bit] != -1) return memo[i][bit]; 
	int ans = 0;
	int b = vec[i].first.second;
	for(int j = i+1;j < vec.size();j++){
		if(b >= vec[j].first.second && (bit & vec[j].second.second) == 0){
			chmax(ans, dp(j, bit));
		}
	}
	ans += vec[i].second.first;
	return memo[i][bit] = ans;
}

signed main(){
	int n;
	cin >> n;

	for(int i = 0;i < n;i++){
		int a, b, c;
		cin >> a >> b >> c;
		vec.push_back({{min(b, c), max(b, c)}, {a, (1 << i)}});
		vec.push_back({{min(a, c), max(a, c)}, {b, (1 << i)}});
		vec.push_back({{min(a, b), max(a, b)}, {c, (1 << i)}});
	}

	sort(vec.begin(), vec.end(), greater<P>());

	int ans = 0;
	memset(memo, -1, sizeof(memo));
	for(int i = 0;i < vec.size();i++){
		chmax(ans, dp(i, 0));
	}

	cout << ans << endl;

	return 0;
}