#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

int N;
int A[3][18];
int DP[(1<<18)][18][3];
bool can[(1<<18)][18][3];
int ans=0;

int solve(int S, int x, int k) {
  if(DP[S][x][k]>0) {
    ans = max(ans, DP[S][x][k]);
    return DP[S][x][k];
  }
  if(S==0) {
    can[S][x][k] = true;
    DP[S][x][k] = A[k][x];
    ans = max(ans, DP[S][x][k]);
    return DP[S][x][k] = A[k][x];
  }
  int tmp1, tmp2, tmp3, tmp4;
  int tmpans;
  int num = 0;
  for(int i=0;i<N;++i) {
    if((S&(1<<i))!=0) num++;
  }
  for(int i=0;i<N;++i) {
    if((S&(1<<i))==0) continue;
    for(int j=0;j<3;++j) {
      tmp1 = max(A[(k+1)%3][x], A[(k+2)%3][x]);
      tmp2 = min(A[(k+1)%3][x], A[(k+2)%3][x]);
      tmp3 = max(A[(j+1)%3][i], A[(j+2)%3][i]);
      tmp4 = min(A[(j+1)%3][i], A[(j+2)%3][i]);
      if(tmp1>tmp3 || tmp2>tmp4) continue;
      else {
        tmpans = solve(S^(1<<i), i, j);
        if(can[S^(1<<i)][i][j]) {
          //DP[S][x][k] = max(DP[S][x][k], solve(S^(1<<i), i, j)+A[k][x]);
          DP[S][x][k] = max(DP[S][x][k], tmpans+A[k][x]);
          can[S][x][k] = true;
        }
      }
    }
  }
  ans = max(ans, DP[S][x][k]);
  return DP[S][x][k];
}

int main() {
  cin>>N;
  for(int i=0;i<N;++i) cin>>A[0][i]>>A[1][i]>>A[2][i];
  int S = (1<<N) - 1;
  for(int i=0;i<N;++i) {
    for(int j=0;j<3;++j) {
      solve(S^(1<<i), i, j);
    }
  }
  cout<<ans<<endl;
}