#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>

using namespace std;

const int INF = static_cast<int>(1e9);

int main() {
    int n;
    cin >> n;
    vector<vector<int>> m(n, vector<int>(n));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> m[i][j];
        }
    }
    vector<int> perm;
    for (int i = 0; i < n; ++i) {
        perm.push_back(i);
    }
    int best = INF;
    do {
        int res = 0;
        bool ok = true;
        perm.push_back(perm[0]);
        for (int i = 0; i < n; ++i) {
            if (m[perm[i]][perm[i + 1]] == 0) {
                ok = false;
                break;
            }
            res += m[perm[i]][perm[i + 1]];
        }
        perm.pop_back();
        if (ok && res < best) {
            best = res;
        }
    } while (next_permutation(perm.begin(), perm.end()));
    if (best == INF) {
        cout << "-1\n";
    } else {
        cout << best << "\n";
    }
    return 0;
}