#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n), b(n), c(n); REP(i, n) cin >> a[i] >> b[i] >> c[i];
  vector dp(1 << n, vector(n, vector(3, -INF)));
  int ans = 0;
  REP(i, n) {
    dp[1 << i][i][0] = a[i];
    dp[1 << i][i][1] = b[i];
    dp[1 << i][i][2] = c[i];
    chmax(ans, max({a[i], b[i], c[i]}));
  }
  FOR(i, 1, 1 << n) REP(j, n) {
    if (!(i >> j & 1)) continue;
    REP(k, 3) {
      int p, q;
      if (k == 0) p = b[j], q = c[j];
      else if (k == 1) p = c[j], q = a[j];
      else if (k == 2) p = a[j], q = b[j];
      REP(l, n) {
        if (i >> l & 1) continue;
        REP(m, 3) {
          int r, s, t;
          if (m == 0) r = b[l], s = c[l], t = a[l];
          else if (m == 1) r = c[l], s = a[l], t = b[l];
          else if (m == 2) r = a[l], s = b[l], t = c[l];
          if ((p <= r && q <= s) || (p <= s && q <= r)) {
            chmax(dp[i | (1 << l)][l][m], dp[i][j][k] + t);
            chmax(ans, dp[i][j][k] + t);
          }
        }
      }
    }
  }
  cout << ans << '\n';
  return 0;
}