/*

  "With age, comes wisdom. With travel, comes understanding.
   Remember that happiness is a way of travel – not a destination"

*/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define int            long long int
#define F              first
#define S              second
#define pb             push_back
#define si             set <int>
#define vi             vector <int>
#define pii            pair <int, int>
#define vpi            vector <pii>
#define vpp            vector <pair<int, pii>>
#define mii            map <int, int>
#define mpi            map <pii, int>
#define spi            set <pii>
#define endl           "\n"
#define sz(x)          ((int) x.size())
#define all(p)         p.begin(), p.end()
#define double         long double
#define que_max        priority_queue <int>
#define que_min        priority_queue <int, vi, greater<int>>
#define bug(...)       __f (#__VA_ARGS__, __VA_ARGS__)
#define print(a)       for(auto x : a) cout << x << " "; cout << endl
#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl
#define print2(a,x,y)  for(int i = x; i < y; i++) cout<< a[i]<< " "; cout << endl

inline int power(int a, int b)
{
     int x = 1;
     while (b)
     {
          if (b & 1) x *= a;
          a *= a;
          b >>= 1;
     }
     return x;
}

typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> Set;

template <typename Arg1>
void __f (const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << endl; }
template <typename Arg1, typename... Args>
void __f (const char* names, Arg1&& arg1, Args&&... args)
{
     const char* comma = strchr (names + 1, ',');
     cout.write (names, comma - names) << " : " << arg1 << " | "; __f (comma + 1, args...);
}

const int N = 16;
int a[N][N], n, m, rng;
int b[1 << 16], cache[1 << 16];

void subsets(int x)
{
     int range = 1LL << x;

     for (int mask = 0; mask < range; mask++)
     {
          vi v;
          for (int i = 0; i < x; i++)
          {
               if (mask & (1LL << i))
                    v.pb(i);
          }
          int s = 0;
          for (int i = 0; i < sz(v); i++)
               for (int j = i + 1; j < sz(v); j++)
                    s += a[v[i]][v[j]];

          b[mask] = s;
     }

}

void dp(int i, const vi& v, int cur, int mask, int g) {
     if (i == (int) v.size())
     {
          cache[mask] = max(cache[mask], cur + b[g]);
          return;
     }
     dp(i + 1, v, cur, mask, g);
     dp(i + 1, v, cur, mask ^ (1 << v[i]), g ^ (1 << v[i]));
}

void solve()
{
     cin >> n;
     for (int i = 0; i < n; i++)
          for (int j = 0; j < n; j++)
               cin >> a[i][j];

     subsets(n);
     cache[0] = 0;
     for (int mask = 0; mask < (1 << n); ++mask)
     {
          vi v;
          for (int i = 0; i < n; ++i)
               if (!(mask & (1 << i)))
                    v.push_back(i);

          dp(0, v, cache[mask], mask, 0);
     }
     cout << cache[(1 << n) - 1];
}

int32_t main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

     cout << setprecision(9) << fixed;
     clock_t z = clock();
     solve();
     cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);

     return 0;
}

Measured memory_bytes: 1280