// ---------- begin chmin, chmax ----------
trait ChangeMinMax {
    fn chmin(&mut self, x: Self) -> bool;
    fn chmax(&mut self, x: Self) -> bool;
}

impl<T: PartialOrd> ChangeMinMax for T {
    fn chmin(&mut self, x: Self) -> bool {
        *self > x && {
            *self = x;
            true
        }
    }
    fn chmax(&mut self, x: Self) -> bool {
        *self < x && {
            *self = x;
            true
        }
    }
}
// ---------- end chmin, chmax ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::cmp::*;

fn run() {
    input! {
        n: usize,
        c: [[u64; n]; n],
    }
    type DP = std::collections::BTreeMap<(usize, usize, usize), u64>;
    let mut dp = DP::new();
    for i in 0..n {
        dp.insert((i, 1 << i, 0), 0);
    }
    let mut ans = std::u64::MAX;
    for _ in 0..(3 * n) {
        let mut next = DP::new();
        for ((prev, bit, used), cost) in dp {
            if bit == (1 << n) - 1 {
                ans.chmin(cost);
                continue;
            }
            for k in 0..n {
                if bit >> k & 1 == 0 {
                    let d = cost + c[prev][k];
                    let mut bit = bit | (1 << k);
                    let mut used = used;
                    if used >> prev & 1 == 0 {
                        bit &= !(1 << prev);
                        used |= 1 << prev;
                    }
                    next.entry((k, bit, used)).or_insert(d).chmin(d);
                }
            }
        }
        dp = next;
    }
    println!("{}", ans);
}

fn main() {
    run();
}