#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

// pの立ってるビットでかつ、
// qの立ってるビットでもあるのを返す
ll func(ll p, ll q, ll n) {
  ll x = 0;
  for (ll i = 0, b = 1, m = 1; i < n; ++i, m <<= 1) {
    while (!(p & b))
      b <<= 1;
    if (q & m)
      x |= b;
    b <<= 1;
  }
  return x;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vvl A = VVL(N, N, 0);
  REP(i, N) REP(j, N) cin >> A[i][j];

  ll P = 1LL << N;
  vl cm(P, 0);
  vl dp(P, 0);
  // cmはビットが立ってる人全員同じグループにした時に得る点

  for (ll i = 0, b = 1; i < N; ++i, b <<= 1) {
    // i番目の人がいないグループにi番目の人を
    //加えるとどうなるか考えてる
    for (ll j = 0; j < b; ++j) {
      ll acc = 0;
      for (ll k = 0, m = 1; m < b; ++k, m <<= 1) {
        if (j & m)
          acc += A[i][k];
      }
      cm[b + j] = cm[j] + acc;
    }
  }

  for (ll p = 1; p < P; ++p) {
    ll n = __builtin_popcount(p);
    if (n < 2)
      continue;
    ll Q = 1LL << n;
    dp[p] = cm[p];
    REP(q, Q) {
      ll alpha = func(p, q, n);
      ll beta = p - alpha;
      dp[p] = max(dp[p], dp[alpha] + dp[beta]);
    }
  }
  cout << dp[P - 1] << endl;

  return 0;
}


Measured memory_bytes: 1280