import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[][](N, 3);
      foreach (u; 0 .. N) foreach (d; 0 .. 3) {
        A[u][d] = readInt();
      }
      
      auto dp = new int[][][](1 << N, N, 3);
      foreach (u; 0 .. N) foreach (d; 0 .. 3) {
        dp[1 << u][u][d] = A[u][d];
      }
      foreach (p; 0 .. 1 << N) {
        foreach (u; 0 .. N) foreach (d; 0 .. 3) {
          if (dp[p][u][d] > 0) {
            const au1 = A[u][(d + 1) % 3];
            const au2 = A[u][(d + 2) % 3];
            foreach (v; 0 .. N) {
              if (!(p & 1 << v)) {
                foreach (e; 0 .. 3) {
                  const av1 = A[v][(e + 1) % 3];
                  const av2 = A[v][(e + 2) % 3];
                  if ((au1 >= av1 && au2 >= av2) || (au1 >= av2 && au2 >= av1)) {
                    chmax(dp[p | 1 << v][v][e], dp[p][u][d] + A[v][e]);
                  }
                }
              }
            }
          }
        }
      }
      int ans;
      foreach (p; 0 .. 1 << N) {
        foreach (u; 0 .. N) foreach (d; 0 .. 3) {
          chmax(ans, dp[p][u][d]);
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}