/* -*- coding: utf-8 -*-
 *
 * 1045.cc:  No.1045 直方体大学 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 16;
const int NBITS = 1 << MAX_N;

/* typedef */

/* global variables */

int xs[MAX_N][3], ys[MAX_N][3], zs[MAX_N][3];
int dp[NBITS][MAX_N][3];

/* subroutines */

inline void setmax(int &a, int b) { if (a < b) a = b; }

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    xs[i][0] = min(a, b), ys[i][0] = max(a, b), zs[i][0] = c;
    xs[i][1] = min(b, c), ys[i][1] = max(b, c), zs[i][1] = a;
    xs[i][2] = min(c, a), ys[i][2] = max(c, a), zs[i][2] = b;
  }

  int nbits = 1 << n;
  memset(dp, -1, sizeof(dp));

  for (int i = 0; i < n; i++)
    for (int j = 0; j < 3; j++)
      dp[1 << i][i][j] = zs[i][j];

  for (int bits = 1; bits < nbits; bits++)
    for (int i = 0; i < n; i++)
      for (int j = 0; j < 3; j++)
	if (dp[bits][i][j] >= 0)
	  for (int i1 = 0, bi = 1; i1 < n; i1++, bi <<= 1)
	    if (! (bits & bi))
	      for (int j1 = 0; j1 < 3; j1++)
		if (xs[i][j] >= xs[i1][j1] && ys[i][j] >= ys[i1][j1])
		  setmax(dp[bits | bi][i1][j1], dp[bits][i][j] + zs[i1][j1]);

  int maxd = 0;
  for (int bits = 1; bits < nbits; bits++)
    for (int i = 0; i < n; i++)
      for (int j = 0; j < 3; j++)
	setmax(maxd, dp[bits][i][j]);

  printf("%d\n", maxd);
  return 0;
}