/* -*- coding: utf-8 -*-
 *
 * 1284.cc:  No.1284 Flip Game - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 9;
const int MAX_N2 = MAX_N * 2;
const int N2BITS = 1 << MAX_N2;
const int INF = ~(1U << 31);

/* typedef */

/* global variables */

int cs[MAX_N][MAX_N];
int dp[N2BITS][MAX_N];

/* subroutines */

inline void setmin(int &a, int b) { if (a > b) a = b; }

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      scanf("%d", cs[i] + j);

  int n2 = n * 2, n2bits = 1 << n2, n2msk = n2bits - 1;

  for (int bits = 0; bits < n2bits; bits++)
    fill(dp[bits], dp[bits] + n, INF);

  for (int i = 0, bi = 1; i < n; i++, bi <<= 1)
    dp[bi][i] = 0;

  for (int bits = 0; bits < n2bits; bits++)
    for (int i = 0; i < n; i++)
      if (dp[bits][i] < INF) {
	int bj0 = 1, bj1 = (1 << n);
	for (int j = 0; j < n; j++, bj0 <<= 1, bj1 <<= 1)
	  if (i != j) {
	    if (! (bits & bj0))
	      setmin(dp[bits | bj0][j], dp[bits][i] + cs[i][j]);
	    else if (! (bits & bj1))
	      setmin(dp[bits | bj1][j], dp[bits][i] + cs[i][j]);
	  }
      }

  int mind = INF;
  for (int i = 0, bi = (1 << n); i < n; i++, bi <<= 1) {
    setmin(mind, dp[n2msk][i]);
    setmin(mind, dp[n2msk ^ bi][i]);
  }
  
  printf("%d\n", mind);
  return 0;
}