#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  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];
  for (int k = 0; k < n; ++k) for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
  vector<vector<int>> dp(1 << n, vector<int> (n, 1e9));
  dp[1][0] = 0;
  for (int i = 0; i < (1 << n); ++i)
  {
    for (int j = 0; j < n; ++j)
    {
      for (int k = 0; k < n; ++k)
      {
        if (i & (1 << k))
        {
          int id = i | (1 << j);
          dp[id][j] = min(dp[id][j], dp[i][k] + (d[k][j] * __builtin_popcount(((1 << n) - 1) ^ i)));
        }
      }
    }
  }
  int ans = 1e9;
  for (int i = 0; i < n; ++i) ans = min(ans, dp[(1 << n) - 1][i]);
  cout << ans << endl;
}