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

#ifdef LOCAL
#include "debug.h"
#else
#define DEBUG(...)
#endif

template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

auto chmax = [](auto&& a, auto b) { return a < b ? a = b, 1 : 0; };

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<array<int, 3>> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i][0] >> a[i][1] >> a[i][2];
  }
  array<int, 3> p{0, 1, 2};
  vector<array<int, 3>> ps;
  do {
    ps.push_back(p);
  } while (next_permutation(begin(p), end(p)));
  map<array<int, 3>, int> mp;
  for (int t = 0; t < 6; ++t) {
    mp[ps[t]] = t;
  }
  vector dp(1 << n, vector(n, vector(6, -inf<int>)));
  for (int i = 0; i < n; ++i) {
    for (int t = 0; t < 6; ++t) {
      dp[1 << i][i][t] = a[i][ps[t][2]];
    }
  }
  for (int bt = 1; bt < 1 << n; ++bt) {
    for (int i = 0; i < n; ++i) {
      if (~bt >> i & 1) continue;
      for (int t = 0; t < 6; ++t) {
        for (int j = 0; j < n; ++j) {
          if (bt >> j & 1) continue;
          for (int nt = 0; nt < 6; ++nt) {
            if (a[j][ps[nt][0]] > a[i][ps[t][0]]) continue;
            if (a[j][ps[nt][1]] > a[i][ps[t][1]]) continue;
            chmax(dp[bt | 1 << j][j][nt], dp[bt][i][t] + a[j][ps[nt][2]]);
          }
        }
      }
    }
  }
  int res = -inf<int>;
  for (int bt = 0; bt < 1 << n; ++bt) {
    for (int i = 0; i < n; ++i) {
      for (int t = 0; t < 6; ++t) {
        chmax(res, dp[bt][i][t]);
      }
    }
  }
  cout << res << '\n';
}