import java.util.Arrays; public class Main { private static void solve() { int n = ni(); int[][] p = ntable(n, 3); int[][][] dp = new int[1 << n][n + 1][3]; for (int[][] v : dp) for (int[] u : v) Arrays.fill(u, -1); dp[0][0][0] = 0; for (int i = 0; i < (1 << n); i++) { for (int j = 0; j <= n; j++) { for (int k = 0; k < 3; k++) { if (dp[i][j][k] < 0) continue; int minA = j == 0 ? Integer.MAX_VALUE : Math.min(p[j - 1][(k + 1) % 3], p[j - 1][(k + 2) % 3]); int maxA = j == 0 ? Integer.MAX_VALUE : Math.max(p[j - 1][(k + 1) % 3], p[j - 1][(k + 2) % 3]); for (int s = 0; s < n; s++) { if (((i >> s) & 1) == 1) continue; for (int t = 0; t < 3; t++) { int minB = Math.min(p[s][(t + 1) % 3], p[s][(t + 2) % 3]); int maxB = Math.max(p[s][(t + 1) % 3], p[s][(t + 2) % 3]); int h = p[s][t]; if (minB <= minA && maxB <= maxA) { dp[i | (1 << s)][s + 1][t] = Math.max(dp[i | (1 << s)][s + 1][t], dp[i][j][k] + h); } } } } } } int ret = 0; for (int[][] v : dp) for (int[] u : v) for (int x : u) ret = Math.max(x, ret); System.out.println(ret); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }