#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <bitset>
#include <tuple>
#include <cmath>
#include <complex>
#include <algorithm>
#include <utility>
#include <regex>
#include <cstdint>
#include <numeric>
#include <functional>
#include <cassert>

using namespace std;
using ll = int64_t;
using ull = uint64_t;

constexpr ll INF = 1000000000;/* 1e+9a */
namespace utils{

    class Repeater{
        int st;
        int ed;
        int d;
    public:
        class rep_iterator{
            int i; int d;
        public:
            rep_iterator(int x, int pd) :i(x), d(pd) {}

            int& operator*(){ return i; }
            bool operator==(const rep_iterator& k) const { return i == k.i; }
            bool operator!=(const rep_iterator& k) const { return i != k.i; }
            rep_iterator& operator++(){ i+=d; return *this; }
        };

        explicit Repeater(int N) :st(0), ed(N), d(1) {}
        Repeater(int b, int e) :st(b), ed(e), d(1) {if(st > ed){ st--; ed--; d = -1; } }

        rep_iterator begin() const{ return rep_iterator(st, d); }
        rep_iterator end() const{ return rep_iterator(ed, d); }

    };

    template<class T, class Compare> using p_queue = priority_queue<T, vector<T>, Compare>;
    template<class T> using min_queue = p_queue<T, greater<T>>;
    template<class T> using max_queue = p_queue<T, less<T>>;

    template<class T> bool min_update(T& X, const T& A){ if(X > A) {X = A; return true;} return false; }
    template<class T> bool max_update(T& X, const T& A){ if(X < A) {X = A; return true;} return false; }
#define ALL(x) begin(x), end(x)
#define rALL(x) rbegin(x), rend(x)
}
using namespace utils;

vector<ll> dp;
vector<vector<ll>> A;

ll real_sub(ll k, ll cm){
    ll ans = 0;
    ll i = 1;
    while(k > 0){
        if(cm & i){
            if(k & 1){
                ans |= i;
            }
            k /= 2;
        }
        i *= 2;
    }
    return ans;
}

void sub_main(istream &is) {
    ll N;
    is >> N;
    if(!is) return;
    A.clear();
    A.resize(N, vector<ll>(N));
    for (auto &&ax : A) {
        for (auto &&a : ax) {
            is >> a;
        } // end a
    } // end ax
    dp.clear();
    dp.resize(1<<N, 0);


    for (int k = 2; k <= N; ++k) {
        int com = (1<<k) - 1;
        while(com < (1<<N)){

            ll oneset = 0;
            for (int i = 0; i < N; ++i) {
                if(com & (1 << i))
                    for (int j = i+1; j < N; ++j) {
                        if(com & (1<<j))
                            oneset += A[i][j];
                    } // end j
            } // end i
            dp[com] = oneset;

            for (int i = 1; i < (1 << k)-1; ++i) {
                auto sub = real_sub(i, com);
                max_update(dp[com], dp[sub] + dp[sub^com]);
            } // end i
            int x = com & -com, y = com + x;
            com = ((com & ~y) / x >> 1) | y;
        }
    } // end k

    cout << dp.back() << endl;

}

int main(int argc, char *argv[]) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(16) << scientific;
#ifdef DEBUG
    string test_cases = "test_U.txt";
    cerr << "DEBUG MODE" <<  endl;
    cerr << test_cases << " -->" << endl;
    auto fs = fstream(test_cases, fstream::in);
    int lp = 0;
    while(fs) {
        lp++;
        cout << lp <<  "#------\n";
        sub_main(fs);
    }
    cout << "------#" << endl;
    if(lp <= 1) sub_main(cin);
#else
    sub_main(cin);
#endif
    return 0;
}


Measured memory_bytes: 896