#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <bits/stdc++.h>
using namespace std;
using i32 = int; using i64 = long long int; using f64 = double; using str = string;
using u32 = unsigned int; using u64 = unsigned long long int;
template <typename T> using vec = vector<T>;
void in() {}; template <typename T, typename...TS> void in(T &&x, TS &&...xs) { cin >> x; in(move(xs)...); };
template <typename T> void _out(const char *sep, const char *end, T &&x) { cout << x << end; };
template <typename T, typename...TS> void _out(const char *sep, const char *end, T &&x, TS &&...xs) { cout << x << sep; _out(sep, end, move(xs)...); }
#define indef(t, ...) t __VA_ARGS__; in(__VA_ARGS__)
#define get(t) []{ t _; cin >> _; return _; }()
#define put(...) _out("", "", __VA_ARGS__)
#define out(...) _out(" ", "\n", __VA_ARGS__)
#define times(n, i) for (i32 i =  0 ; i < (n); ++i)
#define range(a, b, i) for (i32 i = (a); i < (b); ++i)
#define upto(a, b, i) for (i32 i = (a); i <= (b); ++i)
#define downto(a, b, i) for (i32 i = (a); i >= (b); --i)
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define even(x) (((x) & 1) == 0)
#define odd(x) (((x) & 1) == 1)
#define append emplace_back
#define findge lower_bound
#define findgt upper_bound
const i64 MOD = 1000000007;
const f64 EPS = 1e-10;

i32 f[24][24];
i32 dp[(1<<24)-1];

i32 main()
{
    ios::sync_with_stdio(false);

    indef(i32, n);
    times(n, fi) {
        times(n, fj) {
            in(f[fi][fj]);
        }
    }

    times(1<<n, dpi) {
        times(n-1, ni) {
            if (((dpi>>ni)&1) == 0) {
                range(ni+1, n, nj) {
                    if (((dpi>>nj)&1) == 0) {
                        i32 dpj = dpi | (1<<ni) | (1<<nj);
                        dp[dpj] = max(dp[dpi] + f[ni][nj], dp[dpj]);
                    }
                }
                break;
            }
        }
    }
    out(dp[(1<<n)-1]);

    return 0;
}