#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;
		vector<int> vec;
		for(int i = 0; i < n; i++){
			if(bit >> i & 1) continue;
			vec.push_back(i);
			pc++;
		}
		if(pc & 1) continue;
		int i = vec[0];
		for(auto j:vec){
			if(i != j){				
				int nbit = bit | (1 << i) | (1 << j);
				dp[nbit] = max(dp[nbit], dp[bit] + F[i][j]);
			}
		}
	}
	cout << dp[(1 << n) - 1] << "\n";
}

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