import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto C = new long[][](N, N);
      foreach (u; 0 .. N) foreach (v; 0 .. N) {
        C[u][v] = readLong();
      }
      
      alias Entry = Tuple!(long, "c", int, "p", int, "q", int, "u");
      BinaryHeap!(Array!Entry, "a.c > b.c") que;
      auto dist = new long[][][](1 << N, 1 << N, N);
      foreach (p; 0 .. 1 << N) foreach (q; 0 .. 1 << N) {
        dist[p][q][] = INF;
      }
      foreach (u; 0 .. N) {
        chmin(dist[1 << u][0][u], 0);
        que.insert(Entry(0, 1 << u, 0, u));
      }
      for (; !que.empty; ) {
        const c = que.front.c;
        const p = que.front.p;
        const q = que.front.q;
        const u = que.front.u;
        que.removeFront;
        if (dist[p][q][u] == c) {
          foreach (v; 0 .. N) {
            if (!(p & 1 << v)) {
              int pp = p ^ 1 << v;
              int qq = q;
              if (!(q & 1 << u)) {
                assert(p & 1 << u);
                pp ^= 1 << u;
                qq ^= 1 << u;
              }
              const cc = c + C[u][v];
              if (chmin(dist[pp][qq][v], cc)) {
                que.insert(Entry(cc, pp, qq, v));
              }
            }
          }
        }
      }
      
      long ans = INF;
      foreach (q; 0 .. 1 << N) foreach (u; 0 .. N) {
        chmin(ans, dist[(1 << N) - 1][q][u]);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}