#include <bits/stdc++.h>
#define oo (long long)(1e18)
using namespace std;
long long res=-oo, dd[27], x[27], n, a[27][27];
void ghinghiem()
{
long long sum=0;
for(long long i=1; i<=n; i++)sum = sum + a[i][x[i]];
res = max(res , sum );
}
void backtrack(long long i)
{
for(long long j=1; j<=n; j++)
if(dd[j] == 0)
{
x[i] = j;
dd[j] = 1;
if(i == n) ghinghiem();
else backtrack(i + 1);
dd[j] = 0;
}
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
for(long long i=1; i<=n; i++)
for(long long j=1; j<=n; j++) cin >> a[i][j];
backtrack(1);
cout << res;
return 0;
}
/*
Solve by: Truong Tuan Kiet - Informatics K36. Solve in 10h00 - 25/6/2025
*/
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgb28gKGxvbmcgbG9uZykoMWUxOCkKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKbG9uZyBsb25nIHJlcz0tb28sIGRkWzI3XSwgeFsyN10sIG4sIGFbMjddWzI3XTsKdm9pZCBnaGluZ2hpZW0oKQp7Cglsb25nIGxvbmcgc3VtPTA7Cglmb3IobG9uZyBsb25nIGk9MTsgaTw9bjsgaSsrKXN1bSA9IHN1bSArIGFbaV1beFtpXV07CglyZXMgPSBtYXgocmVzICwgc3VtICk7Cn0Kdm9pZCBiYWNrdHJhY2sobG9uZyBsb25nIGkpCnsKCWZvcihsb25nIGxvbmcgaj0xOyBqPD1uOyBqKyspCgkJaWYoZGRbal0gPT0gMCkKCQl7CgkJCXhbaV0gPSBqOwoJCQlkZFtqXSA9IDE7CgkJCWlmKGkgPT0gbikgZ2hpbmdoaWVtKCk7CgkJCWVsc2UgYmFja3RyYWNrKGkgKyAxKTsKCQkJZGRbal0gPSAwOwoJCX0KfQppbnQgbWFpbigpCnsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7Y2luLnRpZSgwKTtjb3V0LnRpZSgwKTsKICAgIGNpbiA+PiBuOwogICAgZm9yKGxvbmcgbG9uZyBpPTE7IGk8PW47IGkrKykKICAgIAlmb3IobG9uZyBsb25nIGo9MTsgajw9bjsgaisrKSBjaW4gPj4gYVtpXVtqXTsKICAgIGJhY2t0cmFjaygxKTsKCWNvdXQgPDwgcmVzOwogICAgcmV0dXJuIDA7Cn0KLyoKCVNvbHZlIGJ5OiBUcnVvbmcgVHVhbiBLaWV0IC0gSW5mb3JtYXRpY3MgSzM2LiBTb2x2ZSBpbiAxMGgwMCAtIDI1LzYvMjAyNQoqLwoKCgoK