#line 2 "/Users/tiramister/CompetitiveProgramming/Cpp/CppLibrary/Tools/vector_alias.hpp"

#include <vector>

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }
#line 2 "main.cpp"

#include <iostream>
#line 5 "main.cpp"

constexpr int INF = 2e9;

int pow(int x, int e) {
    int ret = 1;
    while (e--) ret *= x;
    return ret;
}

void solve() {
    int n;
    std::cin >> n;

    auto css = vec(n, vec(n, INF));
    for (auto &cs : css) {
        for (auto &c : cs) std::cin >> c;
    }

    auto dp = vec(n, vec(pow(3, n), INF));
    for (int i = 0; i < n; ++i) dp[i][pow(3, i)] = 0;

    for (int b = 0; b < pow(3, n); ++b) {
        std::vector<int> xs(n);
        for (int i = 0, bb = b; i < n; ++i, bb /= 3) {
            xs[i] = bb % 3;
        }

        for (int i = 0; i < n; ++i) {
            if (xs[i] == 2) continue;
            int nb = b + pow(3, i);

            for (int p = 0; p < n; ++p) {
                if (p == i) continue;
                dp[i][nb] = std::min(dp[i][nb], dp[p][b] + css[p][i]);
            }
        }
    }

    int ans = INF;
    for (int i = 0; i < n; ++i) {
        ans = std::min(ans, dp[i][pow(3, n) - 1 - pow(3, i)]);
        ans = std::min(ans, dp[i][pow(3, n) - 1]);
    }
    std::cout << ans << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}