import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[][] f = new int[n][n];
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				f[i][j] = sc.nextInt();
			}
		}

		int[] g = new int[1 << n];
		Arrays.fill(g, -Integer.MAX_VALUE / 16);
		g[0] = 0;
		for (int i = 0; i < n; ++i) {
			for (int s = 0; s < (1 << n); ++s) {
				if (g[s] < 0)
					continue;
				if (Integer.bitCount(s) % 2 != 0) {
					continue;
				}
				if ((s & (1 << i)) > 0) {
					continue;
				}
				for (int ne = 0; ne < n; ++ne) {
					if ((s & (1 << ne)) > 0 || s == ne) {
						continue;
					}
					int ns = s | (1 << ne) | (1 << i);
					g[ns] = Math.max(g[ns], g[s] + f[i][ne]);
				}
			}
		}
		System.out.println(g[(1 << n) - 1]);
	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}