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

int main(){
  using ll=long long;
  ll inf=1e18;
  int n;
  cin>>n;
  vector<vector<int>> d(n,vector<int>(n));
  for (int i=0;i<n;i++) for (int j=0;j<n;j++) cin>>d[i][j];
  vector<vector<ll>> dp(1<<n,vector<ll>(n,inf));
  priority_queue<tuple<ll,int,int>> q;
  q.push({0,1,0});
  while (!q.empty()){
    auto [dist,i,v]=q.top();
    q.pop();
    if (dp[i][v]!=inf) continue;
    dist*=-1;
    dp[i][v]=dist;
    for (int u=0;u<n;u++){
      int ni=i|(1<<u);
      if (ni==i) continue;
      ll nd=dist;
      int p=n+1-__popcount(ni);
      nd+=p*d[v][u];
      q.push({-nd,ni,u});
    }
  }
  ll ans=inf;
  for (int i=0;i<n;i++) ans=min(ans,dp[(1<<n)-1][i]);
  cout<<ans<<endl;
}