#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n; cin>>n;
	int a[17], b[17], c[17];
	for(int i=0; i<n; i++) cin>>a[i]>>b[i]>>c[i];
	int dp[48][1<<16]={};
	for(int i=0; i<n; i++){
		dp[i][1<<i]=a[i];
		dp[i+n][1<<i]=b[i];
		dp[i+2*n][1<<i]=c[i];
	}
	int ans=0;
	for(int i=1; i<(1<<n); i++){
		for(int j=0; j<3*n; j++){
			int t=j%n;
			if(!dp[j][i]) continue;
			ans=max(ans, dp[j][i]);
			int x1, y1;
			if(j<n) x1=b[t], y1=c[t];
			else if(j<2*n) x1=a[t], y1=c[t];
			else x1=a[t], y1=b[t];
			for(int k=0; k<3*n; k++){
				int u=k%n;
				if(i&(1<<u)) continue;
				int x2, y2, z2;
				if(k<n) x2=b[u], y2=c[u], z2=a[u];
				else if(k<2*n) x2=a[u], y2=c[u], z2=b[u];
				else x2=a[u], y2=b[u], z2=c[u];
				if((x1>=x2 && y1>=y2) || (x1>=y2 && y1>=x2)){
					dp[k][i^(1<<u)]=max(dp[k][i^(1<<u)], dp[j][i]+z2);
				}
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}