#include<bits/stdc++.h>
// #include<atcoder/scc>
using namespace std;
// using namespace atcoder;

void solve(){    
	int n;
	cin >> n;
	vector<vector<int>> F(n, vector<int>(n, 0));
	for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) cin >> F[i][j];
	vector<int> dp(1 << n, 0);
	for(int bit = 0; bit < (1 << n) - 1; bit++){
		int pc = 0;
		int ii = -1;
		for(int i = 0; i < n; i++){
			if(bit >> i & 1);
			else if(ii == -1) ii - i;
			else{
				int nbit = bit | (1 << i) | (1 << ii);
				dp[nbit] = max(dp[nbit], dp[bit] + F[i][ii]);
			}
		}
	}
	cout << dp[(1 << n) - 1] << "\n";
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	int t;
	t = 1;
	// cin >> t;
	while(t--) solve();
}